199 search results - page 35 / 40 » Auctions with Untrustworthy Bidders |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
106
click to vote
JCSS
2008
14 years 11 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
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...
120
click to vote
SIGECOM
2010
ACM
15 years 3 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
100
click to vote
AMMA
2009
Springer
15 years 5 months ago
2009
Springer
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...