Sciweavers

102291 search results - page 19815 / 20459
» Computing
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
15 years 9 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
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Robust mechanisms for risk-averse sellers
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 ...
Mukund Sundararajan, Qiqi Yan
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Automated market-making in the large: the gates hillman prediction market
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...
Abraham Othman, Tuomas Sandholm
« Prev « First page 19815 / 20459 Last » Next »