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...
Many important problems in multiagent systems involve the allocation of multiple resources among the agents. If agents are self-interested, they will lie about their valuations fo...
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
Abstract. Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences...