Efficiency of Restricted Tolls in Non-atomic Network Routing Games

DOI10.1007/978-3-642-24829-0_27zbMath1233.90077OpenAlexW2159043441MaRDI QIDQ3095283

Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer

Publication date: 28 October 2011

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/17202

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (14)

Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ Improving Selfish Routing for Risk-Averse Players ⋮ Beyond Pigouvian taxes: a worst case analysis ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Unnamed Item ⋮ The impact of worst-case deviations in non-atomic network routing games ⋮ Toll caps in privatized road networks ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ Improving selfish routing for risk-averse players ⋮ Risk-Averse Selfish Routing ⋮ The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games ⋮ Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators

This page was built for publication: Efficiency of Restricted Tolls in Non-atomic Network Routing Games