Sciweavers

70 search results - page 12 / 14
» Vindictive bidding in keyword auctions
Sort
View
IJISEC
2006
108views more  IJISEC 2006»
13 years 7 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
CORR
2006
Springer
148views Education» more  CORR 2006»
13 years 7 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
14 years 26 days ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
WPES
2005
ACM
14 years 1 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora
IOR
2011
96views more  IOR 2011»
12 years 11 months ago
An Ascending Vickrey Auction for Selling Bases of a Matroid
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
Sushil Bikhchandani, Sven de Vries, James Schummer...