Maximizing social welfare in congestion games via redistribution
From MaRDI portal
Publication:495653
DOI10.1016/J.GEB.2015.06.010zbMATH Open1347.91159OpenAlexW834199794MaRDI QIDQ495653FDOQ495653
Richard Steinberg, Victor Naroditskiy
Publication date: 15 September 2015
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/62771/
Recommendations
- Finding social optima in congestion games with positive externalities
- The complexity of welfare maximization in congestion games
- Congestion games revisited
- Mathematical Foundations of Computer Science 2004
- Optimal Mechanisms for Robust Coordination in Congestion Games
- Approximate Pure Nash Equilibria in Social Context Congestion Games
- Optimal cost-sharing in weighted congestion games
- On the Inefficiency of Equilibria in Congestion Games
- Greediness and equilibrium in congestion games
Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- How much can taxes help selfish routing?
- Title not available (Why is that?)
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
- Groves' Scheme on Restricted Domains
- Worst-case optimal redistribution of VCG payments in multi-unit auctions
- Redistribution of VCG Payments in Public Project Problems
- Destroy to save
Cited In (2)
This page was built for publication: Maximizing social welfare in congestion games via redistribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495653)
