Strategyproof sharing of submodular costs: budget balance versus efficiency
From MaRDI portal
Publication:5955107
DOI10.1007/PL00004200zbMath1087.91509OpenAlexW3123380468MaRDI QIDQ5955107
Scott J. Shenker, Hervé Moulin
Publication date: 2001
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00004200
Cooperative games (91A12) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
On Groves mechanisms for costly inclusion ⋮ Characterization of Vickrey auction with reserve price for multiple objects ⋮ Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly ⋮ Unnamed Item ⋮ Collusion, efficiency, and dominant strategies ⋮ Incentive-compatible simple mechanisms ⋮ A general impossibility theorem and its application to individual rights ⋮ Approximation and collusion in multicast cost sharing ⋮ Strong equilibrium in cost sharing connection games ⋮ Beyond Moulin mechanisms ⋮ Optimal cost sharing for capacitated facility location games ⋮ Population monotonicity in matching games ⋮ A cost-sharing scheme for the \(k\)-level facility location game with penalties ⋮ From Cost Sharing Mechanisms to Online Selection Problems ⋮ Cost-Sharing Models in Participatory Sensing ⋮ Strategy-proof rules for an excludable public good ⋮ Sharing the cost of risky projects ⋮ The Moulin-Shenker rule ⋮ Serial cost sharing of an excludable public good available in multiple units ⋮ Is Shapley cost sharing optimal? ⋮ An optimal congestion and cost-sharing pricing scheme for multiclass services ⋮ Sharing loading costs for multi compartment vehicles ⋮ A rescheduling and cost allocation mechanism for delayed arrivals ⋮ Network-formation games with regular objectives ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ A cross-monotonic cost-sharing scheme for the concave facility location game ⋮ Ex-post optimal knapsack procurement ⋮ Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling ⋮ The complexity of egalitarian mechanisms for linear programming games ⋮ A subsidized Vickrey auction for cost sharing ⋮ Cost sharing and strategyproof mechanisms for set cover games ⋮ Reassignment-proof rules for land rental problems ⋮ Implementing efficient graphs in connection networks ⋮ Diffusion auction design ⋮ The conservative equal costs rule, the serial cost sharing rule and the pivotal mechanism: asymptotic welfare loss comparisons for the case of an excludable public project ⋮ Wary of the worst: maximizing award guarantees when new claimants may arrive ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Cost sharing in two-sided markets ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Strategyproofness, non-bossiness and group strategyproofness in a cost sharing model ⋮ A cost-sharing method for the multi-level economic lot-sizing game ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Hardness results for multicast cost sharing. ⋮ Collusive dominant-strategy truthfulness ⋮ Efficiency and Budget Balance ⋮ Collusion-proof mechanisms for multi-unit procurement ⋮ Unnamed Item ⋮ Sharing Rewards Among Strangers Based on Peer Evaluations ⋮ Egalitarian division under Leontief preferences ⋮ Optimal budget-balanced ranking mechanisms to assign identical objects ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ Secure implementation in Shapley-Scarf housing markets ⋮ Group strategyproof cost sharing: the role of indifferences ⋮ A system-theoretic model for cooperation, interaction and allocation ⋮ Coalition strategy-proof mechanisms for provision of excludable public goods. ⋮ The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. ⋮ The Price of Nash Equilibria in Multicast Transmissions Games ⋮ The price of anarchy of serial, average and incremental cost sharing ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Designing cost-sharing methods for Bayesian games ⋮ A cost-sharing method for an uncapacitated facility location game with penalties ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Efficiency and budget balance in general quasi-linear domains ⋮ The worst absolute surplus loss in the problem of commons: random priority versus average cost ⋮ Cost Sharing in Production Economies ⋮ The \(k\)-level facility location game ⋮ Cost-sharing mechanisms for network design ⋮ Egalitarian equivalence and strategyproofness in the queueing problem ⋮ On cost sharing in the provision of a binary and excludable public good ⋮ A complete characterization of group-strategyproof mechanisms of cost-sharing ⋮ Group strategyproofness in queueing models ⋮ Strategyproof cost sharing of a binary good and the egalitarian solution ⋮ Cross-monotonic cost sharing methods for connected facility location games ⋮ Soft-capacitated facility location game ⋮ Pricing traffic in a spanning network ⋮ Computer science and decision theory ⋮ Sharing the cost of multicast transmissions ⋮ Cost-sharing mechanism for excludable goods with generalized non-rivalry ⋮ Competitive auctions ⋮ Leveraging possibilistic beliefs in unrestricted combinatorial auctions ⋮ An efficient and almost budget balanced cost sharing method ⋮ Almost budget-balanced VCG mechanisms to assign multiple objects ⋮ Network design with weighted players ⋮ The warehouse-retailer network design game ⋮ Optimal VCG mechanisms to assign multiple bads ⋮ Is Shapley Cost Sharing Optimal? ⋮ Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location ⋮ Strong price of anarchy ⋮ Cost sharing over combinatorial domains : Complement-free cost functions and beyond ⋮ A cost-sharing method for an economic lot-sizing game ⋮ Designing Cost-Sharing Methods for Bayesian Games ⋮ Gain-sharing in urban consolidation centers ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Mechanism design for set cover games with selfish element agents ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games ⋮ Cheating by groups and cheating over time in surplus sharing problems ⋮ The Banzhaf power index on convex geometries ⋮ A cross-monotonic cost sharing method for the facility location game with service installation costs ⋮ Unnamed Item ⋮ Adversarial behavior in network games ⋮ Strategy-proof cost sharing under increasing returns: improvement of the supremal welfare loss ⋮ Mechanism design with two alternatives in quasi-linear environments ⋮ Welfare asymptotics of the pivotal mechanism for excludable public goods.
