An efficient and almost budget balanced cost sharing method

DOI10.1016/J.GEB.2008.09.028zbMATH Open1206.91014OpenAlexW1991823147MaRDI QIDQ993789FDOQ993789

Hervé Moulin

Publication date: 20 September 2010

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2008.09.028

Recommendations

• New trade-offs in cost-sharing mechanisms
• Is Shapley cost sharing optimal?
• Cost-sharing mechanisms for scheduling under general demand settings
• Quantifying inefficiency in cost-sharing mechanisms
• Strategyproof sharing of submodular costs: budget balance versus efficiency

zbMATH Keywords

mechanism designbudget balancecost sharing mechanismresidual mechanism

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Other game-theoretic models (91A40)

Cites Work

• Title not available (Why is that?)
• Serial Cost Sharing
• Convex Analysis
• Worst-case equilibria
• How bad is selfish routing?
• Potential games
• The worst absolute surplus loss in the problem of commons: random priority versus average cost
• Title not available (Why is that?)
• On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions
• Strategyproof sharing of submodular costs: budget balance versus efficiency
• Beyond Moulin mechanisms
• Fictitious play property for games with identical interests
• On the uniqueness of equilibrium in Cournot oligopoly and other games
• Efficiency of Scalar-Parameterized Mechanisms
• Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game Theory
• Mechanism design in queueing problems
• The price of anarchy of serial, average and incremental cost sharing
• Efficiency Loss in a Network Resource Allocation Game
• Group strategyproof cost sharing: the role of indifferences
• Best response dynamics in finite games with additive aggregation
• 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
• Better redistribution with inefficient allocation in multi-unit auctions
• Efficiency loss in a network resource allocation game: the case of elastic supply
• Existence and Nash implementation of efficient sharing rules for a commonly owned technology
• Cooperative production and efficiency

Cited In (16)

• Efficient allocation of heterogeneous commodities with balanced transfers
• A general impossibility theorem and its application to individual rights
• Cost Sharing in Production Economies
• Designing efficient and incentive compatible mechanisms is almost impossible in quasi-linear environments
• Optimal cost sharing for capacitated facility location games
• Cooperative production and efficiency
• Cost-efficient taxation mechanisms
• A flexible cost share approach to markup estimation
• Consistent cost sharing
• Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
• Growth in Illyria: the role of meritocracy in the accumulation of human capital
• Cost sharing on prices for games on graphs
• Truthful implementation and preference aggregation in restricted domains
• Proportionally adjusted marginal pricing method to share joint costs.
• Fair cost allocation schemes
• Incentive-compatible simple mechanisms

This page was built for publication: An efficient and almost budget balanced cost sharing method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993789)