SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Approximate Equilibria and Ball Fusion
7 references·16 citing·41 second hop
Approximate Equilibria and Ball Fusion (2003)Approximate Equilibria and Ball FusionTight bounds for worst-case equilibria (2002)Tight bounds for worst-case e…Worst-Case Equilibria (1999)Worst-Case EquilibriaArchitecting noncooperative networks (1995)Architecting noncooperative n…A Course in Game Theory (1994)A Course in Game TheoryNon-cooperative games (1989)Non-cooperative gamesRefinements of the Nash equilibrium concept (1978)Refinements of the Nash equil…Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Reexamination of the perfectn…Exact Price of Anarchy for Polynomial Congestion Games (2011)Exact Price of Anarchy for Po…Taxes for linear atomic congestion games (2010)Taxes for linear atomic conge…Selfish Bin Packing (2009)Selfish Bin PackingThe structure and complexity of Nash equilibria for a selfish routing game (2008)The structure and complexity …Regret minimization and the price of total anarchy (2008)Regret minimization and the p…Price of Anarchy (2008)Price of AnarchyAtomic congestion games among coalitions (2008)Atomic congestion games among…A new model for selfish routing (2008)A new model for selfish routi…The Price of Selfish Routing (2007)The Price of Selfish RoutingSelfish Routing with Incomplete Information (2007)Selfish Routing with Incomple…Selfish Load Balancing (2007)Selfish Load BalancingOn the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (2006)On the Price of Stability for…Exact Price of Anarchy for Polynomial Congestion Games (2006)Exact Price of Anarchy for Po…Nash Equilibria in Discrete Routing Games with Convex Latency Functions (2004)Nash Equilibria in Discrete R…A New Model for Selfish Routing (2004)A New Model for Selfish Routi…Selfish traffic allocation for server farms (2002)Selfish traffic allocation fo…The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (2002)Strong Nash Equilibria in Games with the Lexicographical Improvement Property (2009)Characterizing the Existence of Potential Functions in Weighted Congestion Games (2011)The curse of simultaneity (2012)An experimental analysis of ultimatum bargaining (1982)Perfect Equilibrium in a Bargaining Model (1982)Economic Origins of Dictatorship and Democracy (2005)Theory of games and economic behavior (2019)Non-Cooperative Games (1951)A class of games possessing pure-strategy Nash equilibria (1973)Potential Games (1996)The Price of Routing Unsplittable Flow (2013)Barriers to Near-Optimal Equilibria (2014)Weighted Congestion Games (2014)Stability in Competition (1929)Stability in Competition (1990)Routing without regret (2006)The price of anarchy in games of incomplete information (2012)Fast Convergence of Regularized Learning in Games (2015)Inefficiency of Nash Equilibria (1986)Game theory: Analysis of conflict (1992)Competitive routing in multiuser communication networks (1993)Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing (1999)Competitive routing in networks with polynomial costs (2002)Coordination mechanisms (2009)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)RATIONAL CHOICE AND THE FRAMING OF DECISIONS (1988)Algorithmic Mechanism Design (2001)The Theory of Incentives: The Principal-Agent Model (2001)Equilibrium points in n -person games (1950)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Prediction, Learning, and Games (2006)Algorithms, games, and the internet (2001)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Near-optimal network design with selfish agents (2003)The price of selfish behavior in bilateral network formation (2005)Strong price of anarchy (2008)Games of perfect information, predatory pricing and the chain-store paradox (1981)Limit Pricing and Entry under Incomplete Information: An Equilibrium Analysis (1982)Evolution of the Social Contract (2014)
this work references cited by second hop

References

  • 1989Non-cooperative games5,594 cited
  • 1994A Course in Game Theory5,468 cited
  • 1975Reexamination of the perfectness concept for equilibrium points in extensive games3,342 cited
  • 1999Worst-Case Equilibria1,962 cited
  • 1978Refinements of the Nash equilibrium concept739 cited
  • 1995Architecting noncooperative networks241 cited
  • 2002Tight bounds for worst-case equilibria195 cited

Cited by

  • 2008Regret minimization and the price of total anarchy133 cited
  • 2007Selfish Load Balancing113 cited
  • 2011Exact Price of Anarchy for Polynomial Congestion Games104 cited
  • 2006Exact Price of Anarchy for Polynomial Congestion Games99 cited
  • 2002Selfish traffic allocation for server farms97 cited
  • 2006On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations91 cited
  • 2008The structure and complexity of Nash equilibria for a selfish routing game89 cited
  • 2007Selfish Routing with Incomplete Information68 cited
  • 2010Taxes for linear atomic congestion games

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

65 cited
  • 2008Price of Anarchy62 cited
  • 2009Selfish Bin Packing57 cited
  • 2004A New Model for Selfish Routing57 cited
  • 2008Atomic congestion games among coalitions56 cited
  • 2007The Price of Selfish Routing55 cited
  • 2008A new model for selfish routing55 cited
  • 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functions55 cited