On the efficiency of the proportional allocation mechanism for divisible resources
From MaRDI portal
Publication:506522
DOI10.1007/s00224-016-9701-5zbMath1356.91063OpenAlexW996368221WikidataQ59473987 ScholiaQ59473987MaRDI QIDQ506522
Alkmini Sgouritsa, Bo Tang, George Christodoulou
Publication date: 1 February 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-016-9701-5
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (4)
A note on the efficiency of position mechanisms with budget constraints ⋮ Simple combinatorial auctions with budget constraints ⋮ Asymptotic efficiency of the proportional compensation scheme for a large number of producers ⋮ The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Price of Anarchy of the Proportional Allocation Mechanism Revisited
- Welfare Guarantees for Proportional Allocations
- Designing Network Protocols for Good Equilibria
- Efficiency of Scalar-Parameterized Mechanisms
- Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- Efficiency Guarantees in Auctions with Budgets
- Simultaneous auctions are (almost) efficient
- Composable and efficient mechanisms
- Efficiency Loss in a Network Resource Allocation Game
- Automata, Languages and Programming
- Bayesian Combinatorial Auctions
- Subadditive functions
This page was built for publication: On the efficiency of the proportional allocation mechanism for divisible resources
