The price of anarchy of serial, average and incremental cost sharing
From MaRDI portal
Publication:934898
DOI10.1007/s00199-007-0275-yzbMath1146.91008OpenAlexW2043233987MaRDI QIDQ934898
Publication date: 30 July 2008
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-007-0275-y
Noncooperative games (91A10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (18)
Optimal cost sharing for capacitated facility location games ⋮ How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Is Shapley cost sharing optimal? ⋮ Implementing efficient graphs in connection networks ⋮ Wary of the worst: maximizing award guarantees when new claimants may arrive ⋮ Cost sharing on prices for games on graphs ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Group strategyproof cost sharing: the role of indifferences ⋮ Grid Integration of Renewable Electricity and Distributed Control ⋮ Design of price mechanisms for network resource allocation via price of anarchy ⋮ Cost Sharing in Production Economies ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ On cost sharing in the provision of a binary and excludable public good ⋮ Auctioning or assigning an object: some remarkable VCG mechanisms ⋮ An efficient and almost budget balanced cost sharing method ⋮ Bounds on the welfare loss from moral hazard with limited liability ⋮ Almost budget-balanced VCG mechanisms to assign multiple objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordinal cost sharing
- Average cost pricing versus serial cost sharing: An axiomatic comparison
- Potential games
- Fictitious play property for games with identical interests
- On the uniqueness of equilibrium in Cournot oligopoly and other games
- Cooperative production under diminishing marginal returns: interpreting fixed-path methods
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- A contract-based model for directed network formation
- On demand responsiveness in additive cost sharing
- How bad is selfish routing?
- Near-optimal network design with selfish agents
- The Determination of Marginal Cost Prices under a Set of Axioms
- Serial Cost Sharing
- Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
- Efficiency loss in a network resource allocation game: the case of elastic supply
- Efficiency Loss in a Network Resource Allocation Game
- The price of anarchy is independent of the network topology
- Potential games with continuous player sets
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: The price of anarchy of serial, average and incremental cost sharing