Non-cooperative cost sharing games via subsidies
From MaRDI portal
Publication:987398
DOI10.1007/S00224-009-9197-3zbMATH Open1203.91012OpenAlexW2011395778MaRDI QIDQ987398FDOQ987398
Authors: Niv Buchbinder, Liane Lewin-Eytan, Joseph (Seffi) Naor, Ariel Orda 
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
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10)
Cites Work
- 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
- Algorithmic mechanism design
- Coordination mechanisms for selfish scheduling
- Stackelberg scheduling strategies
- Automata, Languages and Programming
- The online set cover problem
- Taxes for Linear Atomic Congestion Games
- Algorithms – ESA 2005
- The effectiveness of Stackelberg strategies and tolls for network congestion games
- Title not available (Why is that?)
Cited In (8)
- Enforcing efficient equilibria in network design games via subsidies
- Efficiency and complexity of price competition among single-product vendors
- Dynamic pricing of servers on trees
- Title not available (Why is that?)
- LP-based covering games with low price of anarchy
- A Little Help from My Friend: International Subsidy Games with Isoelastic Demands
- Subgame consistent cooperative provision of public goods
- Non-cooperative Cost Sharing Games Via Subsidies
This page was built for publication: Non-cooperative cost sharing games via subsidies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987398)
