SZodixStudyAcademic Library
DashboardShelvesOpen accessMy libraryInboxNotesWriteLearnAlerts
More
Ask your libraryNotificationsQuick citeReview
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The effect of collusion in congestion games
16 references·16 citing·28 second hopsampled
The effect of collusion in congestion games (2006)The effect of collusion in congestion gam…The Price of Routing Unsplittable Flow (2005)The Price of Routing Unsplitt…The price of anarchy of finite congestion games (2005)The price of anarchy of finit…The Price of Stability for Network Design with Fair Cost Allocation (2004)The Price of Stability for Ne…The complexity of pure Nash equilibria (2004)The complexity of pure Nash e…The price of anarchy is independent of the network topology (2002)The price of anarchy is indep…Competitive routing in networks with polynomial costs (2002)Competitive routing in networ…Strategyproof sharing of submodular costs:budget balance versus efficiency (2001)Strategyproof sharing of subm…Algorithms, games, and the internet (2001)Algorithms, games, and the in…Worst-Case Equilibria (1999)Worst-Case EquilibriaPotential Games (1996)Potential GamesCongestion Games with Player-Specific Payoff Functions (1996)Congestion Games with Player-…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Existence and Uniqueness of E…16. Acceptable Points in General Cooperative n-Person Games (1959)16. Acceptable Points in Gene…Studies in the Economics of Transportation. (1956)Studies in the Economics of T…Weighted Congestion Games (2014)Weighted Congestion GamesLocal smoothness and the price of anarchy in splittable congestion games (2014)Local smoothness and the pric…Altruism and Its Impact on the Price of Anarchy (2014)Altruism and Its Impact on th…The effectiveness of stackelberg strategies and tolls for network congestion games (2012)The effectiveness of stackelb…The Robust Price of Anarchy of Altruistic Games (2011)The Robust Price of Anarchy o…Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness (2010)Weighted Congestion Games: Pr…Stackelberg Strategies and Collusion in Network Games with Splittable Flow (2010)Stackelberg Strategies and Co…Selfish Bin Packing (2009)Selfish Bin PackingStrong equilibrium in cost sharing connection games (2008)Strong equilibrium in cost sh…Social Context Games (2008)Social Context GamesAtomic congestion games among coalitions (2008)Atomic congestion games among…Altruism, selfishness, and spite in traffic routing (2008)Altruism, selfishness, and sp…The effectiveness of Stackelberg strategies and tolls for network congestion games (2007)The effectiveness of Stackelb…Strong price of anarchy (2007)Strong price of anarchyStrong Price of Anarchy for Machine Load Balancing (2007)Strong Price of Anarchy for M…Adaptive routing with stale information (2005)Adaptive routing with stale i…Evolution and the Theory of Games (1988)Learning, Mutation, and Long Run Equilibria in Games (1993)The Evolution of Conventions (1993)Computing correlated equilibria in multi-player games (2008)Dynamic Noncooperative Game Theory (1982)Achieving network optima using Stackelberg routing strategies (1997)The price of anarchy is independent of the network topology (2003)Games and Decisions (2015)A Course in Game Theory (1994)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)Worst-case equilibria (2009)Equilibrium points in n -person games (1950)The complexity of computing a Nash equilibrium (2006)Theory of Games and Economic Behavior (1947)Equilibrium in supergames with the overtaking criterion (1979)Optimal Incentive Schemes with Many Agents (1984)Comments on the Interpretation of Game Theory (1991)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Balanced-budget redistribution as the outcome of political competition (1987)A survey on networking games in telecommunications (2004)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Evolutionary Game Theory (2011)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)Evolutionary games on graphs (2007)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 1996Potential Games3,617 cited
  • 1965Existence and Uniqueness of Equilibrium Points for Concave N-Person Games2,693 cited
  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1999Worst-Case Equilibria1,962 cited
  • 1956Studies in the Economics of Transportation.1,614 cited
  • 2001Algorithms, games, and the internet1,107 cited
  • 195916. Acceptable Points in General Cooperative n-Person Games886 cited
  • 2004The complexity of pure Nash equilibria662 cited
  • 1996Congestion Games with Player-Specific Payoff Functions661 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 2004The Price of Stability for Network Design with Fair Cost Allocation487 cited
  • 2005The price of anarchy of finite congestion games452 cited
  • 2001Strategyproof sharing of submodular costs:budget balance versus efficiency370 cited
  • 2005The Price of Routing Unsplittable Flow354 cited
  • 2002Competitive routing in networks with polynomial costs213 cited
  • 2002The price of anarchy is independent of the network topology

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

212 cited

Cited by

  • 2008Altruism, selfishness, and spite in traffic routing94 cited
  • 2008Strong equilibrium in cost sharing connection games79 cited
  • 2007Strong price of anarchy75 cited
  • 2007The effectiveness of Stackelberg strategies and tolls for network congestion games75 cited
  • 2007Strong Price of Anarchy for Machine Load Balancing70 cited
  • 2014Weighted Congestion Games62 cited
  • 2014Local smoothness and the price of anarchy in splittable congestion games61 cited
  • 2009Selfish Bin Packing57 cited
  • 2008Atomic congestion games among coalitions56 cited
  • 2014Altruism and Its Impact on the Price of Anarchy55 cited
  • 2005Adaptive routing with stale information54 cited
  • 2010Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness53 cited
  • 2008Social Context Games49 cited
  • 2010Stackelberg Strategies and Collusion in Network Games with Splittable Flow45 cited
  • 2012The effectiveness of stackelberg strategies and tolls for network congestion games45 cited
  • 2011The Robust Price of Anarchy of Altruistic Games42 cited