Sciweavers

203 search results - page 22 / 41
» A New Derandomization of Auctions
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
L. Julian Schvartzman, Michael P. Wellman
ATAL
2003
Springer
14 years 23 days ago
Generalizing preference elicitation in combinatorial auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 7 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
WINE
2010
Springer
145views Economy» more  WINE 2010»
13 years 5 months ago
Course Allocation by Proxy Auction
We propose a new proxy bidding mechanism to allocate courses to students given students' reported preferences. Our mechanism is motivated by a specific strategic downgrading m...
Scott Duke Kominers, Mike Ruberry, Jonathan Ullman