Equilibrium Computation in Atomic Splittable Singleton Congestion Games

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Conference on Integer Programming and Combinatorial Optimization

• Publication date

  2016-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-59250-3_36
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids

  2016cited by this paper
• Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers

  2016influential reference
• Totally Unimodular Congestion Games

  2015cited by this paper
• On the Uniqueness of Equilibrium in Atomic Splittable Routing Games

  2015cited by this paper
• Local smoothness and the price of anarchy in splittable congestion games

  2015cited by this paper
• Resource Competition on Integral Polymatroids

  2014cited by this paper
• Cournot competition in networked markets

  2014cited by this paper
• Network Cournot Competition

  2014cited by this paper
• Multimarket Oligopolies with Restricted Market Access

  2014cited by this paper
• A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem

  2013cited by this paper
• Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

  2011cited by this paper
• Collusion in Atomic Splittable Routing Games

  2011cited by this paper
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

  2011cited by this paper
• On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games

  2011influential reference
• Routing (un-) splittable flow in games with player-specific affine latency functions

  2011cited by this paper
• Linear Complementarity Problem

  2009cited by this paper
• The Impact of Oligopolistic Competition in Networks

  2009cited by this paper
• Equilibria of atomic flow games are not unique

  2009cited by this paper
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow

  2009cited by this paper
• Inapproximability of pure nash equilibria

  2008cited by this paper
• Towards 3-query locally decodable codes of subexponential length

  2008cited by this paper
• Convergence to approximate Nash equilibria in congestion games

  2007cited by this paper
• On the online unit clustering problem

  2007cited by this paper
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users

  2007cited by this paper
• Settling the complexity of computing two-player Nash equilibria

  2007cited by this paper
• On the Impact of Combinatorial Structure on Congestion Games

  2006cited by this paper
• The complexity of computing a Nash equilibrium

  2006cited by this paper
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions

  2006cited by this paper
• Pure Nash Equilibria in Player-Specific and Weighted Congestion Games

  2006cited by this paper
• Games with strategic complementarities: New applications to industrial organization

  2005cited by this paper
• The complexity of pure Nash equilibria

  2004cited by this paper
• Playing large games using simple strategies

  2003cited by this paper
• Supermodularity and Complementarity

  1998cited by this paper
• Capacity allocation under noncooperative routing

  1997cited by this paper
• Cournot Oligopoly and the Theory of Supermodular Games

  1996cited by this paper
• Architecting noncooperative networks

  1995cited by this paper
• Monotone Comparative Statics

  1994cited by this paper
• Competitive routing in multi-user communication networks

  1993cited by this paper
• Competitive routing in multiuser communication networks

  1993cited by this paper
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region

  1991cited by this paper
• Nash equilibrium with strategic complementarities

  1990cited by this paper
• Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities

  1990cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• Algorithms for the Network Oligopoly Problem

  1987cited by this paper
• Multimarket Oligopoly: Strategic Substitutes and Complements

  1985cited by this paper
• On the Existence of Cournot Equilibrium

  1985cited by this paper
• On the relationship between Nash - Cournot and Wardrop equilibria

  1983influential reference
• A class of games possessing pure-strategy Nash equilibria

  1973cited by this paper
• On the number of solutions to the complementarity problem and spanning properties of complementary cones

  1972cited by this paper

• Monotonicity of Equilibria in Nonatomic Congestion Games

  2023cites this paper
• Atomic Splittable Flow Over Time Games

  2020cites this paper
• Uniqueness and computation of equilibria in resource allocation games

  2019cites this paper
• Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians

  2018cites this paper
• Low-Complexity Distributed Radio Access Network Slicing: Algorithms and Experimental Results

  2018cites this paper
• Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians

  2018influential citation
• Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions

  2018cites this paper
• Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs

  2018cites this paper