Beyond Moulin mechanisms
From MaRDI portal
Publication:834858
DOI10.1016/J.GEB.2008.06.005zbMATH Open1168.91314OpenAlexW2078184776MaRDI QIDQ834858FDOQ834858
Authors: Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan 
Publication date: 27 August 2009
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2008.06.005
Recommendations
Cites Work
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Title not available (Why is that?)
- Cooperative facility location games
- A General Approximation Technique for Constrained Forest Problems
- Applications of approximation algorithms to cooperative games
- Optimum branchings
- Title not available (Why is that?)
- Incremental cost sharing: Characterization by coalition strategy-proofness
- On the power of unique 2-prover 1-round games
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Approximation Algorithms for Metric Facility Location Problems
- Heuristics for the fixed cost median problem
- Title not available (Why is that?)
- Cross-monotonic cost sharing methods for connected facility location games
- Group strategyproof cost sharing: the role of indifferences
- An approximation algorithm for the fault tolerant metric facility location problem
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Cost-sharing mechanisms for network design
- A group-strategyproof mechanism for Steiner forests
- An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
- Optimal Efficiency Guarantees for Network Design Mechanisms
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
- Hardness results for multicast cost sharing.
- Limitations of cross-monotonic cost sharing schemes
- Is Shapley Cost Sharing Optimal?
- New trade-offs in cost-sharing mechanisms
- Cost Sharing Methods for Makespan and Completion Time Scheduling
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
- Equitable Cost Allocations via Primal–Dual-Type Algorithms
Cited In (21)
- Black-box reductions for cost-sharing mechanism design
- Asymmetric cost sharing mechanisms
- A general impossibility theorem and its application to individual rights
- The complexity of egalitarian mechanisms for linear programming games
- Designing efficient and incentive compatible mechanisms is almost impossible in quasi-linear environments
- Cost-sharing mechanisms for scheduling under general demand settings
- Group strategyproof cost sharing: the role of indifferences
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
- An efficient and almost budget balanced cost sharing method
- Strategy-proof cost sharing under increasing returns: improvement of the supremal welfare loss
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
- A complete characterization of group-strategyproof mechanisms of cost-sharing
- Is Shapley cost sharing optimal?
- A subsidized Vickrey auction for cost sharing
- Black-box reductions for cost-sharing mechanism design
- Is Shapley Cost Sharing Optimal?
- Cost sharing in two-sided markets
- Modularity and greed in double auctions
- Collusion-proof mechanisms for multi-unit procurement
- Multilateral deferred-acceptance mechanisms
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond
This page was built for publication: Beyond Moulin mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834858)
