SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Network Games with Atomic Players
16 references·7 citing·26 second hop
Network Games with Atomic Players (2006)Network Games with Atomic PlayersThe 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…On a Paradox of Traffic Planning (2005)On a Paradox of Traffic Plann…Selfish Routing in Capacitated Networks (2004)Selfish Routing in Capacitate…Efficiency Loss in a Network Resource Allocation Game (2004)Efficiency Loss in a Network …The price of anarchy is independent of the network topology (2003)The price of anarchy is indep…Algorithms, games, and the internet (2001)Algorithms, games, and the in…Worst-Case Equilibria (1999)Worst-Case EquilibriaCompetitive routing in multiuser communication networks (1993)Competitive routing in multiu…Inefficiency of Nash Equilibria (1986)Inefficiency of Nash Equilibr…On the relationship between Nash—Cournot and Wardrop equilibria (1985)On the relationship between N…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…Traffic assignment problem for a general network (1969)Traffic assignment problem fo…Über ein Paradoxon aus der Verkehrsplanung (1968)Über ein Paradoxon aus der Ve…Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Existence and Uniqueness of E…The Economics of Welfare (1933)The Economics of WelfareStrategic Interactions in Transportation Networks (2018)Strategic Interactions in Tra…The Braess Paradox and Coordination Failure in Directed Networks with Mixed Externalities (2017)The Braess Paradox and Coordi…Cost‐sharing in directed networks: Experimental study of equilibrium choice and system dynamics (2015)Cost‐sharing in directed netw…Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands (2014)Bounding the inefficiency of …Price of Anarchy (2008)Price of AnarchyAtomic congestion games among coalitions (2008)Atomic congestion games among…Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions (2006)Routing (Un-) Splittable Flow…Dynamic Noncooperative Game Theory (1982)Achieving network optima using Stackelberg routing strategies (1997)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)Potential Games (1996)The Price of Stability for Network Design with Fair Cost Allocation (2004)The Price of Stability for Network Design with Fair Cost Allocation (2008)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)The Regulation of Entry (2000)The Theory of Incentives: The Principal-Agent Model (2001)Bank regulation and supervision: what works best? (2003)Balanced-budget redistribution as the outcome of political competition (1987)A survey on networking games in telecommunications (2004)The Economics of Urban Transportation (2007)Trafficking Networks and the Mexican Drug War (2015)Selfish Routing and the Price of Anarchy (2016)A probabilistic multipath traffic assignment model which obviates path enumeration (1971)Traffic Equilibrium and Variational Inequalities (1980)The complexity of pure Nash equilibria (2004)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Evolutionary Game Theory (2011)Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications (2009)Understanding congested travel in urban areas (2016)
this work references cited by second hop

References

  • 1933The Economics of Welfare5,138 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
  • 2001Algorithms, games, and the internet1,107 cited
  • 1968Über ein Paradoxon aus der Verkehrsplanung975 cited
  • 1969Traffic assignment problem for a general network688 cited
  • 2005On a Paradox of Traffic Planning599 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 2004Efficiency Loss in a Network Resource Allocation Game537 cited
  • 2005The price of anarchy of finite congestion games452 cited
  • 2003The price of anarchy is independent of the network topology398 cited
  • 2004Selfish Routing in Capacitated Networks388 cited
  • 2005The Price of Routing Unsplittable Flow354 cited
  • 1986Inefficiency of Nash Equilibria332 cited
  • 1985On the relationship between Nash—Cournot and Wardrop equilibria328 cited

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

Cited by

  • 2008Price of Anarchy62 cited
  • 2006Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions61 cited
  • 2008Atomic congestion games among coalitions56 cited
  • 2017The Braess Paradox and Coordination Failure in Directed Networks with Mixed Externalities22 cited
  • 2015Cost‐sharing in directed networks: Experimental study of equilibrium choice and system dynamics21 cited
  • 2018Strategic Interactions in Transportation Networks7 cited
  • 2014Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands5 cited