##
**An approximate truthful mechanism for combinatorial auctions with single parameter agents.**
*(English)*
Zbl 1094.68528

Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 205-214 (2003).

Summary: Mechanism design seeks algorithms whose inputs are provided by selfish agents who would lie if advantageous. Incentive compatible mechanisms compel the agents to tell the truth by making it in their self-interest to do so. Often, as in combinatorial auctions, such mechanisms involve the solution of NP-hard problems. Unfortunately, approximation algorithms typically destroy incentive compatibility. Randomized rounding is a commonly used technique for designing approximation algorithms. We devise a version of randomized rounding that is incentive compatible, giving a truthful mechanism for combinatorial auctions with single parameter agents (e.g., “single minded bidders”) that approximately maximizes the social value of the auction. We discuss two orthogonal notions of truth-fulness for a randomized mechanism, truthfulness with high probability and in expectation, and give a mechanism that achieves both simultaneously.

We consider combinatorial auctions where multiple copies of many different items are on sale, and each bidder \(i\) desires a subset \(S_i\). Given a set of bids, the problem of finding the allocation of items that maximizes total valuation is the well-known SETPACKING problem. This problem is NP-hard, but for the case of items with many identical copies the optimum can be approximated very well. To turn this approximation algorithm into a truthful auction mechanism we overcome two problems: we show how to make the allocation algorithm monotone, and give a method to compute the appropriate payments efficiently.

For the entire collection see [Zbl 1006.00017].

We consider combinatorial auctions where multiple copies of many different items are on sale, and each bidder \(i\) desires a subset \(S_i\). Given a set of bids, the problem of finding the allocation of items that maximizes total valuation is the well-known SETPACKING problem. This problem is NP-hard, but for the case of items with many identical copies the optimum can be approximated very well. To turn this approximation algorithm into a truthful auction mechanism we overcome two problems: we show how to make the allocation algorithm monotone, and give a method to compute the appropriate payments efficiently.

For the entire collection see [Zbl 1006.00017].

### MSC:

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

### Keywords:

randomized rounding
PDF
BibTeX
XML
Cite

\textit{A. Archer} et al., in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2003, Baltimore, MD, USA, January 12--14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 205--214 (2003; Zbl 1094.68528)