Beyond Moulin mechanisms
From MaRDI portal
Publication:834858
Recommendations
Cites work
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1099360 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Greedy Heuristic for the Set-Covering Problem
- A group-strategyproof mechanism for Steiner forests
- A threshold of ln n for approximating set cover
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- An approximation algorithm for the fault tolerant metric facility location problem
- An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
- Applications of approximation algorithms to cooperative games
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Cooperative facility location games
- Cost Sharing Methods for Makespan and Completion Time Scheduling
- Cost-sharing mechanisms for network design
- Cross-monotonic cost sharing methods for connected facility location games
- Equitable Cost Allocations via Primal–Dual-Type Algorithms
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Group strategyproof cost sharing: the role of indifferences
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
- Hardness results for multicast cost sharing.
- Heuristics for the fixed cost median problem
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Is Shapley Cost Sharing Optimal?
- Limitations of cross-monotonic cost sharing schemes
- New trade-offs in cost-sharing mechanisms
- On the power of unique 2-prover 1-round games
- Optimal Efficiency Guarantees for Network Design Mechanisms
- Optimum branchings
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(20)- Cost sharing in two-sided markets
- Group strategyproof cost sharing: the role of indifferences
- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
- A general impossibility theorem and its application to individual rights
- Strategy-proof cost sharing under increasing returns: improvement of the supremal welfare loss
- Designing efficient and incentive compatible mechanisms is almost impossible in quasi-linear environments
- Collusion-proof mechanisms for multi-unit procurement
- Asymmetric cost sharing mechanisms
- Is Shapley cost sharing optimal?
- Multilateral deferred-acceptance mechanisms
- An efficient and almost budget balanced cost sharing method
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
- Black-box reductions for cost-sharing mechanism design
- Modularity and greed in double auctions
- Is Shapley Cost Sharing Optimal?
- Black-box reductions for cost-sharing mechanism design
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond
- The complexity of egalitarian mechanisms for linear programming games
- A subsidized Vickrey auction for cost sharing
- Cost-sharing mechanisms for scheduling under general demand settings
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)
