Sciweavers

14 search results - page 2 / 3
» Incentives in Online Auctions via Linear Programming
Sort
View
MFCS
2005
Springer
13 years 10 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
WWW
2011
ACM
13 years 5 days ago
An expressive mechanism for auctions on the web
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
Paul Dütting, Monika Henzinger, Ingmar Weber
AAAI
2007
13 years 7 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...
CORR
2008
Springer
134views Education» more  CORR 2008»
13 years 5 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, ...
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 5 months ago
A Truthful Mechanism for Offline Ad Slot Scheduling
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...
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, M...