Call a Vickrey-Clarke-Groves (VCG) mechanism to assign p identi-cal objects among n agents, feasible if cash transfers yield no deficit. The efficiency loss of such a mechanism is the worst (largest) ratio of the budget surplus to the efficient surplus, over all profiles of non neg-ative valuations. The optimal (smallest) efficiency loss eL(n, p) satisfies eL(n, p) ≤ eL(n, {n
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand...
There are p heterogeneous objects to be assigned to n competing agents (n> p) each with unit dema...
We study the problem where a group of agents need to choose from a finite set of social outcomes. We...
A VCG mechanism to assign p identical objects is feasible is cash transfers yield no deficit. The ef...
A VCG mechanism to assign p identical objects is feasible is cash transfers yield no deficit. The ef...
Subsidy-free VCG mechanisms assign p identical objects to n agents. The efficiency loss is the large...
Mechanisms for coordinating group decision-making among self-interested agents often employ a truste...
For allocation problems with one or more items, the well-known Vickrey-Clarke-Groves (VCG) mechanism...
We construct a variant of the Vickrey auction of a single object where the surplus is split in exoge...
In this paper, we seek to design a Groves mechanism for assigning p heterogeneous objects among n co...
In this paper, we seek to design a Groves mechanism for assigning p heterogeneous objects among n co...
For the problem of allocating one or more items among a group of com-peting agents, the Vickrey-Clar...
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clark...
We study the problem of allocating m identical items among n>m agents with unit demand and privat...
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand...
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand...
There are p heterogeneous objects to be assigned to n competing agents (n> p) each with unit dema...
We study the problem where a group of agents need to choose from a finite set of social outcomes. We...
A VCG mechanism to assign p identical objects is feasible is cash transfers yield no deficit. The ef...
A VCG mechanism to assign p identical objects is feasible is cash transfers yield no deficit. The ef...
Subsidy-free VCG mechanisms assign p identical objects to n agents. The efficiency loss is the large...
Mechanisms for coordinating group decision-making among self-interested agents often employ a truste...
For allocation problems with one or more items, the well-known Vickrey-Clarke-Groves (VCG) mechanism...
We construct a variant of the Vickrey auction of a single object where the surplus is split in exoge...
In this paper, we seek to design a Groves mechanism for assigning p heterogeneous objects among n co...
In this paper, we seek to design a Groves mechanism for assigning p heterogeneous objects among n co...
For the problem of allocating one or more items among a group of com-peting agents, the Vickrey-Clar...
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clark...
We study the problem of allocating m identical items among n>m agents with unit demand and privat...
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand...
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand...
There are p heterogeneous objects to be assigned to n competing agents (n> p) each with unit dema...
We study the problem where a group of agents need to choose from a finite set of social outcomes. We...