Sciweavers

68 search results - page 13 / 14
» Optimal Auctions for Spiteful Bidders
Sort
View
AMMA
2009
Springer
14 years 25 days ago
Auctions with Dynamic Populations: Efficiency and Revenue Maximization
ABSTRACT: We examine an environment where goods and privately informed buyers arrive stochastically to a market. A seller in this setting faces a sequential allocation problem with...
Maher Said
CORR
2008
Springer
134views Education» more  CORR 2008»
13 years 6 months ago
Online Ad Slotting With Cancellations
Many advertisers (bidders) use Internet systems to buy advertisements on publishers' webpages or on traditional media such as radio, TV and newsprint. They seek a simple, onl...
Florin Constantin, Jon Feldman, S. Muthukrishnan, ...
COLT
2003
Springer
13 years 11 months ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
13 years 11 months ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
AAAI
2007
13 years 8 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...