35 search results - page 6 / 7 » Improved Algorithms for Optimal Winner Determination in Comb... |
INFOCOM
2009
IEEE
14 years 3 days 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...
AAAI
2004
13 years 6 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
SIGECOM
2008
ACM
13 years 5 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
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...
ATAL
2006
Springer
13 years 7 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...