22 search results - page 4 / 5 » Truth Revelation in Approximately Efficient Combinatorial Au... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
HICSS
2007
IEEE
13 years 11 months ago
2007
IEEE
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
AIR
2004
13 years 5 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...