Stochastic and Contingent Payment Auctions

  • Max Chickering ,
  • Chris Meek ,
  • David Wilson

In First Workshop on Sponsored Search Auctions |

Published by ACM

We describe a family of stochastic auctions that are incentive-compatible (i.e., “truthful”), and which generalize Vickrey auctions. We describe situations in which such stochastic auctions are useful. We then discuss contingent-payment auctions and their incentive-compatible counterparts Finally, we discuss how to utilize both reinforcement-learning techniques and stochastic auctions to learn probabilities for contingencies.