Maximizing social welfare in congestion games via redistribution

DOI10.1016/J.GEB.2015.06.010MaRDI QIDQ495653zbMATH OpenOpenAlexFDO

Authors Victor Naroditskiy, Richard Steinberg

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/

zbMATH Keywords

congestionredistribution mechanismsVCG

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

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

Cites work

• Almost budget-balanced VCG mechanisms to assign multiple objects
• Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
• Destroy to save
• Groves' Scheme on Restricted Domains
• How much can taxes help selfish routing?
• Microeconomic theory
• Redistribution of VCG payments in public project problems
• Worst-case optimal redistribution of VCG payments in multi-unit auctions

Cited in

(3)

• Transfer implementation in congestion games
• Social optimality and cooperation in nonatomic congestion games.
• Budgeted personalized incentive approaches for smoothing congestion in resource networks

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)