A generalization of the top trading cycle algorithm
Event details
| Date | 07.10.2010 |
| Hour | 16:15 |
| Speaker | Brammert Ottens, PhD LIA |
| Location |
INM 202
|
| Category | Conferences - Seminars |
This talk will be the first of a, hopefully successful, series of open problem talks. It will thus be not about a solved problem, but about a problem we don't know how to solve. We hope that, by putting the problem out in the open, we can make use of the collective knowledge present at the epfl and encourage more cooperation between different labs and or fields. The format will consists of a 15 minutes introduction to the problem, followed by a discussion.
The first talk will be about a generalization of the so called Top Trading Cycle (TTC) algorithm. The TTC algorithm tries to allocate resources to users (houses to buyers), where every user is interested in only a single resource. It is a simple mechanism that is incentive compatible, i.e. it is in the users best interest to tell the truth, and does not require any money. However, when generalizing to a setting where users are interested in multiple items, like for example packet allocation in logistics, the mechanism breaks down. This talk will about how to generalize the TTC algorithm to this more general setting without losing incentive compatibility or introducing payments.
Links
Practical information
- General public
- Free
Contact
- Muriel Bardet