Sciweavers

549 search results - page 48 / 110
» Computational Bundling for Auctions
Sort
View
FOCS
2007
IEEE
14 years 4 months ago
Balloon Popping With Applications to Ascending Auctions
Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
12 years 12 days ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
UAI
2004
13 years 11 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman

Publication
466views
14 years 8 months ago
Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Search Auctions
In pay-per click sponsored search auctions which are cur- rently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) c...
Akash Das Sarma, Sujit Gujar, Y. Narahari
SIGECOM
2003
ACM
97views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
A robust open ascending-price multi-unit auction protocol against false-name bids
This paper presents a new ascending-price multi-unit auction protocol. As far as the authors are aware, this is the first protocol that has an open format, and in which sincere b...
Atsushi Iwasaki, Makoto Yokoo, Kenji Terada