We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
We study a problem of dynamic allocation without money. Agents have
arrivals and departures and strict preferences over items. Strategyproofness
requires the
use of an arriva...
Presented at First Electrical Science Divisional Symposium, Indian Institute of Science.
This is joint work with Prof David Parkes, Harvard University.
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...