Taxes for linear atomic congestion games
From MaRDI portal
Publication:3188995
DOI10.1145/1868237.1868251zbMath1295.91006OpenAlexW2070173191MaRDI QIDQ3188995
Christos Kaklamanis, Ioannis Caragiannis, Panagiotis Kanellopoulos
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1868237.1868251
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Quadratic programming (90C20) Macroeconomic theory (monetary models, models of taxation) (91B64)
Related Items (17)
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games ⋮ Mechanisms for (mis)allocating scientific credit ⋮ Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ A Selective Tour Through Congestion Games ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Transportation network with externalities ⋮ Unnamed Item ⋮ Non-atomic one-round walks in congestion games ⋮ Congestion games with priority-based scheduling ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ A Stackelberg strategy for routing flow over time ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ On Stackelberg strategies in affine congestion games ⋮ Market inefficiency, entry order and coordination ⋮ Enforcing efficient equilibria in network design games via subsidies
This page was built for publication: Taxes for linear atomic congestion games
