SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Efficiency of Restricted Tolls in Non-atomic Network Routing Games
16 references·7 citing·28 second hop
Efficiency of Restricted Tolls in Non-atomic Network Routing Games (2011)Efficiency of Restricted Tolls in Non-ato…Stackelberg Routing in Arbitrary Networks (2010)Stackelberg Routing in Arbitr…On the Performance of Approximate Equilibria in Congestion Games (2010)On the Performance of Approxi…Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders (2010)Approximation Algorithms for …Intrinsic robustness of the price of anarchy (2009)Intrinsic robustness of the p…The effectiveness of Stackelberg strategies and tolls for network congestion games (2007)The effectiveness of Stackelb…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…Internet and Network Economics (2005)Internet and Network EconomicsHow much can taxes help selfish routing? (2005)How much can taxes help selfi…Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games (2004)Tolls for Heterogeneous Selfi…Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users (2004)Edge Pricing of Multicommodit…The price of anarchy is independent of the network topology (2003)The price of anarchy is indep…Pricing network edges for heterogeneous selfish users (2003)Pricing network edges for het…Worst-Case Equilibria (1999)Worst-Case EquilibriaStudies in the Economics of Transportation (1958)Studies in the Economics of T…Studies in the Economics of Transportation. (1956)Studies in the Economics of T…Toll Design for Routing Games With Stochastic Demands (2022)Toll Design for Routing Games…A Budged-Balanced Tolling Scheme for Efficient Equilibria under Heterogeneous Preferences (2019)A Budged-Balanced Tolling Sch…Risk-Averse Selfish Routing (2018)Risk-Averse Selfish RoutingLearning System-Efficient Equilibria in Route Choice Using Tolls (2018)Learning System-Efficient Equ…Optimal Mechanisms for Robust Coordination in Congestion Games (2017)Optimal Mechanisms for Robust…Avoiding perverse incentives in affine congestion games (2016)Avoiding perverse incentives …Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms (2013)Improving the Price of Anarch…Equilibrium points in n -person games (1950)A class of games possessing pure-strategy Nash equilibria (1973)Sink Equilibria and Convergence (2005)Coordination mechanisms (2009)A Course in Game Theory (1994)Potential Games (1996)The Economics of Welfare (1933)Non-Cooperative Games (1951)Non-cooperative games (1989)The Impact of Oligopolistic Competition in Networks (2009)Prediction, Learning, and Games (2006)Algorithmic game theory (2010)Composable and efficient mechanisms (2013)Distributed Welfare Games (2013)Algorithms, games, and the internet (2001)Bounding the inefficiency of equilibria in nonatomic congestion games (2003)Joint Strategy Fictitious Play With Inertia for Potential Games (2009)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Coordination mechanisms for selfish scheduling (2008)Two Randomized Mechanisms for Combinatorial Auctions (2007)A Cascade Model for Externalities in Sponsored Search (2008)Ad Exchanges: Research Issues (2009)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)Stackelberg scheduling strategies (2001)Network Design with Weighted Players (2008)
this work references cited by second hop

References

  • 1999Worst-Case Equilibria1,962 cited
  • 1956Studies in the Economics of Transportation.1,614 cited
  • 2005The price of anarchy of finite congestion games452 cited
  • 2003The price of anarchy is independent of the network topology398 cited
  • 2005The Price of Routing Unsplittable Flow354 cited
  • 2009Intrinsic robustness of the price of anarchy333 cited
  • 2005Internet and Network Economics318 cited
  • 2004Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games211 cited
  • 2003Pricing network edges for heterogeneous selfish users206 cited
  • 1958Studies in the Economics of Transportation147 cited
  • 2005How much can taxes help selfish routing?141 cited
  • 2004Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users112 cited
  • 2010Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders92 cited
  • 2007The effectiveness of Stackelberg strategies and tolls for network congestion games75 cited
  • 2010On the Performance of Approximate Equilibria in Congestion Games67 cited
  • 2010Stackelberg Routing in Arbitrary Networks

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

47 cited

Cited by

  • 2017Optimal Mechanisms for Robust Coordination in Congestion Games40 cited
  • 2013Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms33 cited
  • 2018Risk-Averse Selfish Routing5 cited
  • 2022Toll Design for Routing Games With Stochastic Demands4 cited
  • 2016Avoiding perverse incentives in affine congestion games4 cited
  • 2018Learning System-Efficient Equilibria in Route Choice Using Tolls4 cited
  • 2019A Budged-Balanced Tolling Scheme for Efficient Equilibria under Heterogeneous Preferences4 cited