149
Voted
Publication
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 ...
218
Voted
Publication
In this paper, we seek to design a Groves mechanism for
assigning p heterogeneous objects among n competing agents (n > p)
with unit demand, satisfying weak budget balance, in...
214
Voted
Publication
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
s...