Fast Convex Decomposition for Truthful Social Welfare Approximation

DOI10.1007/978-3-319-13129-0_9zbMath1406.91125arXiv1408.2690OpenAlexW172234512MaRDI QIDQ2936980

Salman Fadaei, Martin Bichler, Dennis Kraft

Publication date: 7 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2690

zbMATH Keywords

approximation algorithmsmechanism designconvex decompositiontruthful in expectation

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Welfare economics (91B15)

Related Items (5)

Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design ⋮ A simple and fast algorithm for convex decomposition in relax-and-round mechanisms ⋮ Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents ⋮ Towards more practical linear programming-based techniques for algorithmic mechanism design ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations

This page was built for publication: Fast Convex Decomposition for Truthful Social Welfare Approximation