Sciweavers

364 search results - page 57 / 73
» Mechanisms for Multi-Unit Auctions
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 2 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
ATAL
2008
Springer
15 years 3 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
AAAI
2010
15 years 3 months ago
Asymmetric Spite in Auctions
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...
Ankit Sharma, Tuomas Sandholm
106
Voted
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 1 months ago
Sponsored Search Auctions with Markovian Users
Abstract. Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auct...
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Mar...
100
Voted
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 7 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum