Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design

DOI10.1007/978-3-662-48433-3_8zbMath1358.91058OpenAlexW2584917054MaRDI QIDQ3449585

Fahimeh Ramezani, Kurt Mehlhorn, Khaled M. Elbassioni

Publication date: 4 November 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-002C-0B1C-9

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design, Towards more practical linear programming-based techniques for algorithmic mechanism design

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• A sublinear-time randomized approximation algorithm for matrix games
• Fast Convex Decomposition for Truthful Social Welfare Approximation
• Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design
• Randomized metarounding
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Algorithmic Game Theory
• Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations