Truthful Mechanisms via Greedy Iterative Packing

DOI10.1007/978-3-642-03685-9_5zbMath1254.68354arXiv0906.2466OpenAlexW2067557609MaRDI QIDQ3638869

Iftah Gamzu, Chandra Chekuri

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of game theory (91A80) Combinatorial optimization (90C27) Approximation algorithms (68W25) Welfare economics (91B15)

Related Items (6)

Optimal interval scheduling with a resource constraint ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ Truthful mechanism design for bin packing with applications on cloud computing ⋮ Online knapsack revisited

This page was built for publication: Truthful Mechanisms via Greedy Iterative Packing