Auctions with Anticipated Regret

This paper demonstrates theoretically and experimentally that in first price auctions, overbidding with respect to risk neutral Nash equilibrium might be driven from anticipated loser regret (felt when bidders lose at an affordable price). Different information structures are created to elicit regret: bidders know they will learn the winning bid if they lose (loser regret condition); or the second highest bid if they win (winner regret condition); or no information regarding the other bids. Bidders only in loser regret condition anticipated regret and significantly overbid; in the other conditions bidders did not anticipate regret and hence did not overbid.overbidding, first price auction, anticipated regret

Discrete Clock Auctions: An Experimental Study

We analyze the implications of different pricing rules in discrete clock auctions. The two most common pricing rules are highest-rejected bid (HRB) and lowest-accepted bid (LAB). Under HRB, the winners pay the lowest price that clears the market; under LAB, the winners pay the highest price that clears the market. Both the HRB and LAB auctions maximize revenues and are fully efficient in our setting. Our experimental results indicate that the LAB auction achieves higher revenues. This also is the case in a version of the clock auction with provisional winners. This revenue result may explain the frequent use of LAB pricing. On the other hand, HRB is successful in eliciting true values of the bidders both theoretically and experimentally.Auctions, clock auctions, spectrum auctions, experimental economics, behavioral economics, market design

Common-Value Auctions with Liquidity Needs: An Experimental Test of a Troubled Assets Reverse Auction

We experimentally test alternative auction designs suitable for pricing and removing troubled assets from banks’ balance sheets as part of the financial rescue. Many individual securities or pools of securities are auctioned simultaneously. Securities that are widely held are purchased in auctions for individual securities. Securities with concentrated ownership are purchased as pools of related securities. Each bank has private information about its liquidity need and the true common value of each security. We study bidding behavior and performance of sealed-bid uniform-price auctions and dynamic clock auctions. The clock and sealed-bid auctions resulted in similar prices. However, the clock auctions resulted in substantially higher bank payoffs, since the dynamic auction enabled the banks to better manage their liquidity needs. The clock auctions also reduced bidder error. The experiments demonstrated the feasibility of quickly implementing simple and effective auction designs to help resolve the crisis.Auctions, financial auctions, financial crisis

Anticipated loser regret in third price auctions

Losing the auction at an affordable price generates loser regret. In third price auctions if bidders anticipate loser regret, then in line with the experimental findings, in a symmetric equilibrium the bids are more than the risk neutral Nash equilibrium.Overbidding Third price auction Regret

Auctions with Anticipated Regret: Theory and Experiment

This paper demonstrates theoretically and experimentally that in first-price auctions overbidding with respect to the risk neutral Nash equilibrium might be driven from anticipated loser regret (felt when bidders lose at an affordable price). Different information structures are created to elicit regret: bidders know they will learn the winning bid if they lose (loser regret condition); or the second-highest bid if they win (winner regret condition); or they will receive no feedback regarding the other bids. Bidders in loser regret condition anticipated regret and significantly overbid. However, bidders in the winner regret condition did not anticipate regret. (JEL D44)

Discrete Clock Auctions: An Experimental Study

We analyze the implications of different pricing rules in discrete clock auctions. The two most common pricing rules are highest-rejected bid (HRB) and lowest-accepted bid (LAB). Under HRB, the winners pay the lowest price that clears the market; under LAB, the winners pay the highest price that clears the market. In theory, both the HRB and LAB auctions maximize revenues and are fully efficient in our setting. Our experimental results indicate that the LAB auction achieves higher revenues. This revenue result may explain the frequent use of LAB pricing. On the other hand, HRB is successful in eliciting true values of the bidders both theoretically and experimentally