Sciweavers

199 search results - page 16 / 40
» Auctions with Untrustworthy Bidders
Sort
View
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
15 years 15 days ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
AMAI
2005
Springer
14 years 11 months ago
Auction design with costly preference elicitation
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
David C. Parkes
ATAL
2006
Springer
15 years 2 months ago
A Comparison of Sequential and Simultaneous Auctions
Sequential and simultaneous auctions are two important mechanisms for buying/selling multiple objects. These two mechanisms yield different outcomes (i.e., different revenues and a...
S. Shaheen Fatima
AMEC
2004
Springer
15 years 4 months ago
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
Adam I. Juda, David C. Parkes
ATAL
2008
Springer
15 years 1 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal