Sciweavers

628 search results - page 13 / 126
» Designing the perfect auction
Sort
View
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
DEXAW
2002
IEEE
80views Database» more  DEXAW 2002»
14 years 2 months ago
Private Auctions with Multiple Rounds and Multiple Items
For selling spectrum licenses economists have designed new auction types proceeding over several rounds and offering several licenses simultaneously. Communication between bidders...
Ahmad-Reza Sadeghi, Matthias Schunter, Sandra Stei...
ATAL
2006
Springer
14 years 1 months ago
Competing sellers in online markets: reserve prices, shill bidding, and auction fees
In this paper, we consider competition between sellers offering similar items in concurrent online auctions, where each seller must set its individual auction parameters (such as ...
Enrico H. Gerding, Alex Rogers, Rajdeep K. Dash, N...
UAI
2004
13 years 11 months ago
Bidding under Uncertainty: Theory and Experiments
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
Amy R. Greenwald, Justin A. Boyan
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 11 months ago
Competitiveness via consensus
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 ...
Andrew V. Goldberg, Jason D. Hartline