Design of price mechanisms for network resource allocation via price of anarchy
From MaRDI portal
Publication:662298
DOI10.1007/S10107-010-0379-1zbMath1273.90040OpenAlexW1979851831MaRDI QIDQ662298
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0379-1
Communication networks in operations research (90B18) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (2)
Optimal cost sharing for capacitated facility location games ⋮ Almost budget-balanced VCG mechanisms to assign multiple objects
Cites Work
- Unnamed Item
- Unnamed Item
- Implementation of first-best allocations via generalized tax schedules
- The price of anarchy of serial, average and incremental cost sharing
- Axiomatizations of game theoretical solutions for one-output cost sharing problems
- Average cost pricing versus serial cost sharing: An axiomatic comparison
- Three methods to share joint costs or surplus
- Bounding the inefficiency of equilibria in nonatomic congestion games
- On the uniqueness of equilibrium in Cournot oligopoly and other games
- Multi-product serial cost sharing: An incompatibility with the additivity axiom
- Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance
- Rate control for communication networks: shadow prices, proportional fairness and stability
- How bad is selfish routing?
- The price of anarchy of finite congestion games
- The Determination of Marginal Cost Prices under a Set of Axioms
- Demand Compatible Equitable Cost Sharing Prices
- No-Envy and Consistency in Economies with Indivisible Goods
- Serial Cost Sharing
- Nash Equilibrium and Welfare Optimality
- Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information
- Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
- Algorithmic Game Theory
- Efficiency Loss in a Network Resource Allocation Game
- The Price of Routing Unsplittable Flow
This page was built for publication: Design of price mechanisms for network resource allocation via price of anarchy
