Sciweavers

199 search results - page 7 / 40
» Auctions with Untrustworthy Bidders
Sort
View
SIGECOM
2005
ACM
120views ECommerce» more  SIGECOM 2005»
15 years 4 months ago
Optimal design of English auctions with discrete bid levels
In this paper we consider a common form of the English auction that is widely used in online Internet auctions. This discrete bid auction requires that the bidders may only submit...
Esther David, Alex Rogers, Jeremy Schiff, Sarit Kr...
85
Voted
AAAI
2012
13 years 1 months ago
Optimal Auctions for Spiteful Bidders
Designing revenue-optimal auctions for various settings is perhaps the most important, yet sometimes most elusive, problem in mechanism design. Spiteful bidders have been intensel...
Pingzhong Tang, Tuomas Sandholm
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
15 years 4 months ago
From optimal limited to unlimited supply auctions
We investigate the class of single-round, sealed-bid auctions for a set of identical items in unlimited supply. We adopt the worst-case competitive framework defined by [8, 4] th...
Jason D. Hartline, Robert McGrew
ACMICEC
2003
ACM
160views ECommerce» more  ACMICEC 2003»
15 years 4 months ago
An algorithm for computing the outcome of combinatorial auctions with proxy bidding
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...
CAEPIA
2011
Springer
13 years 11 months ago
Solving Sequential Mixed Auctions with Integer Programming
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions ...
Boris Mikhaylov, Jesús Cerquides, Juan A. R...