267 search results - page 4 / 54 » Online Auctions: There Can Be Only One |
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 ...
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...
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...
JACM
2006
13 years 9 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...