Sciweavers

199 search results - page 22 / 40
» Auctions with Untrustworthy Bidders
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
WWW
2009
ACM
15 years 11 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
WINE
2005
Springer
147views Economy» more  WINE 2005»
15 years 4 months ago
Optimal Starting Price in Online Auctions
Reserve price auctions are one of hot research topics in the traditional auction theory. Here we study the starting price in an online auction, counterpart of the public reserve pr...
Hai Yu, Shouyang Wang, Chuangyin Dang
IAT
2008
IEEE
15 years 5 months ago
Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Mak...