Sciweavers

364 search results - page 59 / 73
» Mechanisms for Multi-Unit Auctions
Sort
View
107
Voted
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 7 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
PERCOM
2009
ACM
15 years 8 months ago
Auction-Based Congestion Management for Target Tracking in Wireless Sensor Networks
—This paper addresses the problem of providing congestion-management for a shared wireless sensor networkbased target tracking system. In many large-scale wireless sensor network...
Lei Chen 0005, Boleslaw K. Szymanski, Joel W. Bran...
ATAL
2003
Springer
15 years 7 months ago
Generalizing preference elicitation in combinatorial auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
ATAL
2008
Springer
15 years 3 months ago
Engineering large-scale distributed auctions
The functional characteristics of market-based solutions are typically best observed through the medium of simulation, data-gathering and subsequent visualization. We previously d...
Peter Gradwell, Michel A. Oey, Reinier J. Timmer, ...
AAAI
2004
15 years 3 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...