Non-cooperative cost sharing games via subsidies
From MaRDI portal
Publication:987398
DOI10.1007/s00224-009-9197-3zbMath1203.91012OpenAlexW2011395778MaRDI QIDQ987398
Joseph (Seffi) Naor, Niv Buchbinder, Ariel Orda, Liane Lewin-Eytan
Publication date: 13 August 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9197-3
Noncooperative games (91A10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Efficiency and complexity of price competition among single-product vendors ⋮ Dynamic pricing of servers on trees ⋮ LP-based covering games with low price of anarchy ⋮ Enforcing efficient equilibria in network design games via subsidies
Cites Work
- Unnamed Item
- Unnamed Item
- Coordination mechanisms for selfish scheduling
- How much can taxes help selfish routing?
- A class of games possessing pure-strategy Nash equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- The online set cover problem
- Stackelberg scheduling strategies
- Taxes for Linear Atomic Congestion Games
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Algorithmic mechanism design