BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:A generalization of the top trading cycle algorithm
DTSTART:20101007T161500
DTSTAMP:20260509T211714Z
UID:36f6e8bc221aa0dbf5ccbd33f8c54e6d6dc74c1cb8000e28555c4807
CATEGORIES:Conferences - Seminars
DESCRIPTION:Brammert Ottens\, PhD LIA\nThis talk will be the first of a\, 
 hopefully successful\, series of open problem talks. It will thus be not a
 bout 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 t
 he collective knowledge present at the epfl and encourage more cooperation
  between different labs and or fields. The format will consists of a 15 mi
 nutes introduction to the problem\, followed by a discussion.\n\nThe first
  talk will be about a generalization of the so called Top Trading Cycle (T
 TC) algorithm. The TTC algorithm tries to allocate resources to users (hou
 ses 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. H
 owever\, when generalizing to a setting where users are interested in mult
 iple items\, like for example packet allocation in logistics\, the mechani
 sm breaks down. This talk will about how to generalize the TTC algorithm t
 o this more general setting without losing incentive compatibility or intr
 oducing payments.
LOCATION:INM 202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR