The price of anarchy of serial, average and incremental cost sharing
From MaRDI portal
Publication:934898
DOI10.1007/S00199-007-0275-YzbMATH Open1146.91008OpenAlexW2043233987MaRDI QIDQ934898FDOQ934898
Authors: Hervé Moulin 
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
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10)
Cites Work
- Serial Cost Sharing
- Worst-case equilibria
- How bad is selfish routing?
- Title not available (Why is that?)
- Potential games
- Potential games with continuous player sets
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Fictitious play property for games with identical interests
- On the uniqueness of equilibrium in Cournot oligopoly and other games
- Ordinal cost sharing
- Average cost pricing versus serial cost sharing: An axiomatic comparison
- The Determination of Marginal Cost Prices under a Set of Axioms
- Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
- A contract-based model for directed network formation
- Title not available (Why is that?)
- Efficiency Loss in a Network Resource Allocation Game
- On demand responsiveness in additive cost sharing
- The price of anarchy is independent of the network topology
- Cooperative production under diminishing marginal returns: interpreting fixed-path methods
- Near-optimal network design with selfish agents
- Efficiency loss in a network resource allocation game: the case of elastic supply
- Title not available (Why is that?)
Cited In (25)
- The impact of spillback on the price of anarchy for flows over time
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium
- Prices of anarchy, information, and cooperation in differential games
- Price of anarchy in a linear-state stochastic dynamic game
- Optimal cost sharing for capacitated facility location games
- Group strategyproof cost sharing: the role of indifferences
- Almost budget-balanced VCG mechanisms to assign multiple objects
- An efficient and almost budget balanced cost sharing method
- Design of price mechanisms for network resource allocation via price of anarchy
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Is Shapley cost sharing optimal?
- Bounds on the welfare loss from moral hazard with limited liability
- The price of anarchy in large games
- On cost sharing in the provision of a binary and excludable public good
- Cost sharing in production economies
- Grid integration of renewable electricity and distributed control
- Cost sharing on prices for games on graphs
- Strong equilibria in games with the lexicographical improvement property
- Implementing efficient graphs in connection networks
- Optimal cost-sharing in general resource selection games
- Restoring Pure Equilibria to Weighted Congestion Games
- Arbitrary profit sharing in federated learning utility games
- Wary of the worst: maximizing award guarantees when new claimants may arrive
- Cost sharing mechanisms for fair pricing of resource usage
- Price of anarchy for mean field games
This page was built for publication: The price of anarchy of serial, average and incremental cost sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q934898)
