Sciweavers

361 search results - page 55 / 73
» Risk-averse auction agents
Sort
View
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
14 years 28 days ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
UAI
2004
13 years 9 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
AMEC
2003
Springer
14 years 23 days ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
ICMAS
2000
13 years 9 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
CEC
2010
IEEE
13 years 8 months ago
Born to trade: A genetically evolved keyword bidder for sponsored search
In sponsored search auctions, advertisers choose a set of keywords based on products they wish to market. They bid for advertising slots that will be displayed on the search result...
Michael Munsey, Jonathan Veilleux, Sindhura Bikkan...