89 search results - page 8 / 18 » Robust solutions for combinatorial auctions |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
DALT
2008
Springer
13 years 10 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
IPCO
2007
13 years 10 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
— We design truthful double spectrum auctions where multiple parties can trade spectrum based on their individual needs. Open, market-based spectrum trading motivates existing sp...
ATAL
2010
Springer
13 years 9 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...