SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Congestion Games with Player-Specific Constants
10 references·4 citing·39 second hop
Congestion Games with Player-Specific Constants (2007)Congestion Games with Player-Specific Con…The structure and complexity of Nash equilibria for a selfish routing game (2008)The structure and complexity …On the Impact of Combinatorial Structure on Congestion Games (2006)On the Impact of Combinatoria…Selfish unsplittable flows (2005)Selfish unsplittable flowsThe complexity of pure Nash equilibria (2004)The complexity of pure Nash e…The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (2002)The Structure and Complexity …Atomic Resource Sharing in Noncooperative Networks (2001)Atomic Resource Sharing in No…CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES (1997)CONGESTION MODELS AND WEIGHTE…Potential Games (1996)Potential GamesCongestion Games with Player-Specific Payoff Functions (1996)Congestion Games with Player-…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…A traffic congestion analysis by user equilibrium and system optimum with incomplete information (2020)A traffic congestion analysis…Uncertainty in Multi-Commodity Routing Networks: When does it help? (2018)Uncertainty in Multi-Commodit…Strong equilibria in games with the lexicographical improvement property (2012)Strong equilibria in games wi…Strong Nash Equilibria in Games with the Lexicographical Improvement Property (2009)Strong Nash Equilibria in Gam…The Price of Stability for Network Design with Fair Cost Allocation (2004)Fast convergence to nearly optimal solutions in potential games (2008)Convergence to approximate Nash equilibria in congestion games (2009)Intrinsic Robustness of the Price of Anarchy (2015)Game theory: analysis of conflict (1992)Competitive routing in multiuser communication networks (1993)Achieving network optima using Stackelberg routing strategies (1997)Selfish Load Balancing (2007)Exact Price of Anarchy for Polynomial Congestion Games (2011)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2012)Non-Cooperative Games (1951)Non-cooperative games (1989)A Course in Game Theory (1994)On nash equilibria for a network creation game (2006)Tight bounds for worst-case equilibria (2007)Worst-Case Equilibria (1999)On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, (2005)Convergence time to Nash equilibrium in load balancing (2007)Approximating Congestion + Dilation in Networks via "Quality of Routing” Games (2011)Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model (1967)CONGESTION GAMES AND POTENTIALS RECONSIDERED (1999)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Selfish Routing with Incomplete Information (2007)Dynamics in congestion games (2010)Evolution and the Theory of Games (1988)Learning, Mutation, and Long Run Equilibria in Games (1993)The Evolution of Conventions (1993)The price of anarchy of finite congestion games (2005)Computing correlated equilibria in multi-player games (2008)Equilibrium points in n -person games (1950)The complexity of computing a Nash equilibrium (2006)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2010)Competitive routing over time (2011)Optimal Cost Sharing for Resource Selection Games (2012)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Evolutionary Game Theory (2011)Evolutionary game dynamics (2003)Evolutionary games on graphs (2007)
this work references cited by second hop

References

  • 1996Potential Games3,617 cited
  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 2004The complexity of pure Nash equilibria662 cited
  • 1996Congestion Games with Player-Specific Payoff Functions661 cited
  • 2006On the Impact of Combinatorial Structure on Congestion Games245 cited
  • 2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game218 cited
  • 2005Selfish unsplittable flows212 cited
  • 2001Atomic Resource Sharing in Noncooperative Networks120 cited
  • 2008The structure and complexity of Nash equilibria for a selfish routing game89 cited
  • 1997CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES79 cited

Cited by

  • 2009Strong Nash Equilibria in Games with the Lexicographical Improvement Property54 cited
  • 2012Strong equilibria in games with the lexicographical improvement property37 cited
  • 2020A traffic congestion analysis by user equilibrium and system optimum with incomplete information12 cited
  • 2018Uncertainty in Multi-Commodity Routing Networks: When does it help?5 cited

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