Efficiency of restricted tolls in non-atomic network routing games

DOI10.1007/978-3-642-24829-0_27zbMATH Open1233.90077OpenAlexW2159043441MaRDI QIDQ3095283FDOQ3095283

Authors 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

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

Recommendations

• Computing optimal tolls with arc restrictions and heterogeneous players
• Cost-balancing tolls for atomic network congestion games
• Linear tolls suffice: new bounds and algorithms for tolls in single source networks
• The effectiveness of Stackelberg strategies and tolls for network congestion games
• Automata, Languages and Programming

Cited in

(17)

• Computing optimal tolls with arc restrictions and heterogeneous players
• The impact of worst-case deviations in non-atomic network routing games
• The impact of worst-case deviations in non-atomic network routing games
• Existence of anonymous link tolls for decentralizing an oligopolistic game and the efficiency analysis
• Tight inefficiency bounds for perception-parameterized affine congestion games
• Achieving target equilibria in network routing games without knowing the latency functions
• The minimum tollbooth problem in atomic network congestion games with unsplittable flows
• 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
• Toll caps in privatized road networks
• Risk-averse selfish routing
• Network spot‐checking games: Theory and application to toll enforcing in transportation networks
• Price of anarchy for parallel link networks with generalized mean objective
• Improving selfish routing for risk-averse players
• Demand-independent optimal tolls
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095283)