scientific article; zbMATH DE number 7053324

zbMath1425.91069MaRDI QIDQ5743446

Chaitanya Swamy, Konstantinos Georgiou

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095188

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Linear programming (90C05) Other game-theoretic models (91A40) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Related Items (4)

The complexity of egalitarian mechanisms for linear programming games ⋮ Unnamed Item ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Efficient Black-Box Reductions for Separable Cost Sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to approximating partial covering problems
• Cross-monotonic cost sharing methods for connected facility location games
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity
• Beyond Moulin mechanisms
• A factor 2 approximation algorithm for the generalized Steiner network problem
• New efficiency results for makespan cost sharing
• Fair cost-sharing methods for scheduling jobs on parallel machines
• A necessary and sufficient condition for rationalizability in a quasilinear context
• Primal-dual algorithms for connected facility location problems
• Incremental cost sharing: Characterization by coalition strategy-proofness
• Cost-sharing mechanisms for network design
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
• Bayesian algorithmic mechanism design
• Black-Box Reductions in Mechanism Design
• Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
• Approximation Algorithms for Metric Facility Location Problems
• Quantifying inefficiency in cost-sharing mechanisms
• A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
• Simpler and better approximation algorithms for network design
• Cost Sharing Methods for Makespan and Completion Time Scheduling
• Optimal Auction Design
• Incentives in Teams
• A General Approximation Technique for Constrained Forest Problems
• Limitations of cross-monotonic cost-sharing schemes
• An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
• Applications of approximation algorithms to cooperative games
• Provisioning a virtual private network
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Black-Box Randomized Reductions in Algorithmic Mechanism Design
• Optimal Efficiency Guarantees for Network Design Mechanisms
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
• Is Shapley Cost Sharing Optimal?
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
• Sharing the cost of multicast transmissions
• Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: