SZodixStudyAcademic Library

Shelves Open 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 · Study

WorkEfficiency of Restricted Tolls in Non-atomic Network Routing Games

Vincenzo Bonifaci A2011

Work2011

Efficiency of Restricted Tolls in Non-atomic Network Routing Games

Vincenzo Bonifaci A · Mahyar Salek · Guido Schäfer

42 citations·0/0 files stored·Lecture notes in computer science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Transportation Planning and Optimization Complexity and Algorithms in Graphs

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 42 citations exist upstream.

References

1999Worst-Case Equilibria 1956Studies in the Economics of Transportation.2005The price of anarchy of finite congestion games 2003The price of anarchy is independent of the network topology 2005The Price of Routing Unsplittable Flow 2009Intrinsic robustness of the price of anarchy 2005Internet and Network Economics 2004Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games

Cited by

2017Optimal Mechanisms for Robust Coordination in Congestion Games 2013Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms 2018Risk-Averse Selfish Routing 2019A Budged-Balanced Tolling Scheme for Efficient Equilibria under Heterogeneous Preferences 2016Avoiding perverse incentives in affine congestion games 2022Toll Design for Routing Games With Stochastic Demands

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2012The effectiveness of stackelberg strategies and tolls for network congestion gamesarticle · 10 shared references 2009The Impact of Oligopolistic Competition in Networksarticle · 8 shared references 2007The effectiveness of Stackelberg strategies and tolls for network congestion gamesarticle · 8 shared references 2010Taxes for linear atomic congestion gamesarticle · 8 shared references 2009Efficient coordination mechanisms for unrelated machine schedulingother · 8 shared references 2008Altruism, selfishness, and spite in traffic routingother · 7 shared references

Details

Year2011

Typeother

Published2011-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations42

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-642-24829-0_27

openalex_workW2159043441

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2018

Learning System-Efficient Equilibria in Route Choice Using Tolls