Abstract
We propose truthful approximation mechanisms for strategic variants of the generalized assignment problem (GAP) in a payment-free environment. In GAP, a set of items has to be optimally assigned to a set of bins without exceeding the capacity of any singular bin. In our strategic variant, bins are held by strategic agents and each agent may hide its willingness to receive some items in order to obtain items of higher values. The model has applications in auctions with budgeted bidders.
Original language | English |
---|---|
Pages (from-to) | 72-76 |
Number of pages | 5 |
Journal | Operations Research Letters |
Volume | 45 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2017 |
Keywords
- Approximation
- Generalized assignment problem
- Mechanism design without money
- Truthfulness