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...
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
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...
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...
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 ...