1034 search results - page 6 / 207 » Competitive generalized auctions |
STACS
2004
Springer
14 years 2 months ago
2004
Springer
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
WECWIS
2005
IEEE
14 years 2 months ago
2005
IEEE
Many e-services are time-sensitive as the users request them for a specific time period. Such services need to be repeatedly offered to keep them constantly utilized. This paper s...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
AAAI
2010
13 years 10 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...