Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimistic-Conservative Bidding in Sequential Auctions

Published 30 Jan 2015 in cs.GT | (1501.07687v1)

Abstract: In this work we consider selling items using a sequential first price auction mechanism. We generalize the assumption of conservative bidding to extensive form games (henceforth optimistic conservative bidding), and show that for both linear and unit demand valuations, the only pure subgame perfect equilibrium where buyers are bidding in an optimistic conservative manner is the minimal Walrasian equilibrium. In addition, we show examples where without the requirement of conservative bidding, subgame perfect equilibria can admit a variety of unlikely predictions, including high price of anarchy and low revenue in markets composed of additive bidders, equilibria which elicit all the surplus as revenue, and more. We also show that the order in which the items are sold can influence the outcome.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.