199 search results - page 26 / 40 » Auctions with Untrustworthy Bidders |
SODA
2003
ACM
15 years 15 days ago
2003
ACM
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
AAAI
2011
13 years 11 months ago
2011
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
SODA
2010
ACM
15 years 8 months ago
2010
ACM
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...
91
Voted
WWW
2007
ACM
15 years 11 months ago
2007
ACM
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to o...