SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Exact Price of Anarchy for Polynomial Congestion Games
16 references·16 citing·23 second hopsampled
Exact Price of Anarchy for Polynomial Congestion Games (2006)Exact Price of Anarchy for Polynomial Con…Selfish Routing and the Price of Anarchy (2016)Selfish Routing and the Price…Selfish Routing and the Price of Anarchy (2006)Selfish Routing and the Price…The price of anarchy of finite congestion games (2005)The price of anarchy of finit…Strategic Learning and its Limits (2004)Strategic Learning and its Li…Algorithms, games, and the internet (2001)Algorithms, games, and the in…Worst-Case Equilibria (1999)Worst-Case EquilibriaSolutions manual for Microeconomic theory : Mas-Colell, Whinston and Green (1997)Solutions manual for Microeco…Potential Games (1996)Potential GamesCongestion Games with Player-Specific Payoff Functions (1996)Congestion Games with Player-…Non-cooperative games (1989)Non-cooperative gamesSubjectivity and correlation in randomized strategies (1974)Subjectivity and correlation …A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…Studies in the Economics of Transportation. (1957)Studies in the Economics of T…Studies in the Economics of Transportation. (1956)Studies in the Economics of T…Non-Cooperative Games (1951)Non-Cooperative GamesEquilibrium points in n -person games (1950)Equilibrium points in n -pers…The price of anarchy in large games (2016)The price of anarchy in large…Risk sensitivity of price of anarchy under uncertainty (2013)Risk sensitivity of price of …Local smoothness and the price of anarchy in atomic splittable congestion games (2011)Local smoothness and the pric…Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness (2010)Weighted Congestion Games: Pr…The Impact of Altruism on the Efficiency of Atomic Congestion Games (2010)The Impact of Altruism on the…Stackelberg Strategies and Collusion in Network Games with Splittable Flow (2010)Stackelberg Strategies and Co…On the Performance of Approximate Equilibria in Congestion Games (2010)On the Performance of Approxi…On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2010)On the Existence of Pure Nash…Efficient coordination mechanisms for unrelated machine scheduling (2009)Efficient coordination mechan…Stackelberg Strategies for Atomic Congestion Games (2008)Stackelberg Strategies for At…Price of Anarchy (2008)Price of AnarchyOn the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games (2008)On the Complexity of Pure-Str…A Priority-based Model of Routing (2008)A Priority-based Model of Rou…Total Latency in Singleton Congestion Games (2007)Total Latency in Singleton Co…Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions (2006)Routing (Un-) Splittable Flow…Nash Equilibria in Discrete Routing Games with Convex Latency Functions (2004)Nash Equilibria in Discrete R…Correlated Equilibrium as an Expression of Bayesian Rationality (1987)A Behavioral Approach to the Rational Choice Theory of Collective Action Presidential Address, American political Science Association, 1997 (2010)Theory of games and economic behavior (2019)A Course in Game Theory (1994)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)Worst-case equilibria (2009)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Evolutionary Game Theory (2011)Evolutionary games on graphs (2007)Existence of an equilibrium for a competitive economy (2008)Traffic Equilibrium and Variational Inequalities (1980)Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Prediction, Learning, and Games (2006)An efficient approach to solving the road network equilibrium traffic assignment problem (1975)The existence, uniqueness and stability of traffic equilibria (1979)Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)Evolutionary game dynamics (2003)The complexity of pure Nash equilibria (2004)Covenants with and without a Sword: Self-Governance Is Possible (1992)A theory of sequential reciprocity (2003)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 1950Equilibrium points in n -person games7,555 cited
  • 1951Non-Cooperative Games6,999 cited
  • 1989Non-cooperative games5,594 cited
  • 1996Potential Games3,617 cited
  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1999Worst-Case Equilibria1,962 cited
  • 1974Subjectivity and correlation in randomized strategies1,630 cited
  • 1956Studies in the Economics of Transportation.1,614 cited
  • 1957Studies in the Economics of Transportation.1,489 cited
  • 2001Algorithms, games, and the internet1,107 cited
  • 1997Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green966 cited
  • 2006Selfish Routing and the Price of Anarchy686 cited
  • 1996Congestion Games with Player-Specific Payoff Functions661 cited
  • 2016Selfish Routing and the Price of Anarchy647 cited
  • 2004Strategic Learning and its Limits606 cited
  • 2005The price of anarchy of finite congestion games452 cited

Cited by

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2010
On the Performance of Approximate Equilibria in Congestion Games
67 cited
  • 2008Price of Anarchy62 cited
  • 2006Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions61 cited
  • 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functions55 cited
  • 2008Stackelberg Strategies for Atomic Congestion Games54 cited
  • 2010Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness53 cited
  • 2008On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games52 cited
  • 2011Local smoothness and the price of anarchy in atomic splittable congestion games50 cited
  • 2016The price of anarchy in large games45 cited
  • 2010Stackelberg Strategies and Collusion in Network Games with Splittable Flow45 cited
  • 2008A Priority-based Model of Routing45 cited
  • 2010On the Existence of Pure Nash Equilibria in Weighted Congestion Games41 cited
  • 2013Risk sensitivity of price of anarchy under uncertainty40 cited
  • 2010The Impact of Altruism on the Efficiency of Atomic Congestion Games40 cited
  • 2007Total Latency in Singleton Congestion Games38 cited
  • 2009Efficient coordination mechanisms for unrelated machine scheduling38 cited