Presented at First Electrical Science Divisional Symposium, Indian Institute of Science.
This is joint work with Prof David Parkes, Harvard University.
There are p heterogeneous objects to be assigned to n
competing agents (n > p) each with unit demand. It is
required to design a Groves mechanism for this assignment
problem ...
This presentation was given as part of theory seminars @ Dept of CSA, Indian Institute of Science, Bangalore. This talk explains about assignment problem and why mechanism design i...
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...