Truthful Unification Framework for Packing Integer Programs with Choices

DOI10.1007/978-3-540-70575-8_68MaRDI QIDQ3521969zbMATH OpenOpenAlexFDO

Authors Iftah Gamzu, Yossi Azar

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_68

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Truthful Mechanisms via Greedy Iterative Packing
• Approximation techniques for utilitarian mechanism design
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Approximate composable truthful mechanism design
• Approximation techniques for utilitarian mechanism design

This page was built for publication: Truthful Unification Framework for Packing Integer Programs with Choices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521969)