The price of anarchy of serial, average and incremental cost sharing

DOI10.1007/S00199-007-0275-YMaRDI QIDQ934898zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Cost sharingAverage costDemand gameIncremental costPrice of anarchySocial costSurplus

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10)

Recommendations

• Cost sharing mechanisms for fair pricing of resource usage
• Optimal cost-sharing in weighted congestion games
• The price of anarchy in large games
• Integer Programming and Combinatorial Optimization
• The price of anarchy of the proportional allocation mechanism revisited

Cites work

• scientific article; zbMATH DE number 3655624 (Why is no real title available?)
• scientific article; zbMATH DE number 54099 (Why is no real title available?)
• scientific article; zbMATH DE number 2226166 (Why is no real title available?)
• A contract-based model for directed network formation
• Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
• Average cost pricing versus serial cost sharing: An axiomatic comparison
• Cooperative production under diminishing marginal returns: interpreting fixed-path methods
• Efficiency Loss in a Network Resource Allocation Game
• Efficiency loss in a network resource allocation game: the case of elastic supply
• Fictitious play property for games with identical interests
• How bad is selfish routing?
• Near-optimal network design with selfish agents
• On demand responsiveness in additive cost sharing
• On the uniqueness of equilibrium in Cournot oligopoly and other games
• Ordinal cost sharing
• Potential games
• Potential games with continuous player sets
• Serial Cost Sharing
• Strategyproof sharing of submodular costs: budget balance versus efficiency
• The Determination of Marginal Cost Prices under a Set of Axioms
• The price of anarchy is independent of the network topology
• The worst absolute surplus loss in the problem of commons: random priority versus average cost
• Worst-case equilibria

Cited in

(25)

• Almost budget-balanced VCG mechanisms to assign multiple objects
• Group strategyproof cost sharing: the role of indifferences
• Price of anarchy for mean field games
• Strong equilibria in games with the lexicographical improvement property
• The price of anarchy in large games
• Arbitrary profit sharing in federated learning utility games
• Cost sharing mechanisms for fair pricing of resource usage
• Wary of the worst: maximizing award guarantees when new claimants may arrive
• Optimal cost-sharing in general resource selection games
• Grid integration of renewable electricity and distributed control
• Prices of anarchy, information, and cooperation in differential games
• Bounds on the welfare loss from moral hazard with limited liability
• Auctioning or assigning an object: some remarkable VCG mechanisms
• Is Shapley cost sharing optimal?
• On cost sharing in the provision of a binary and excludable public good
• An efficient and almost budget balanced cost sharing method
• The impact of spillback on the price of anarchy for flows over time
• Implementing efficient graphs in connection networks
• Design of price mechanisms for network resource allocation via price of anarchy
• Cost sharing on prices for games on graphs
• How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium
• Restoring Pure Equilibria to Weighted Congestion Games
• Cost sharing in production economies
• Price of anarchy in a linear-state stochastic dynamic game
• Optimal cost sharing for capacitated facility location 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)