Winners in online auctions frequently fail to complete purchases. Major auction platforms therefore allow "second-chance" offers, where the runner-up bidder pays his own bid price, and they let sellers leave negative feedback on buyers who default. We show theoretically that (i) all else equal,...

Winning bidders in online auctions frequently fail to complete the transaction. Because enforcing bids usually is too costly, auction platforms often allow sellers to make a "secondchance" offer to the second highest bidder, to buy at the bid price of this bidder, and let sellers leave negative...

This paper revisits the no-recall assumption in job search models with take-it-or-leave-it offers. Workers who can recall previously encountered potential employers in order to engage them in Bertrand bidding have a distinct advantage over workers without such attachments. Firms account for this...

This paper revisits the no-recall assumption in job search models with take-it-or-leave-it offers. Workers who can recall previously encountered potential employers in order to engage them in Bertrand bidding have a distinct advantage over workers without such attachments. Firms account for this...

This paper revisits the no-recall assumption in job search models with take-it-or-leave-it offers. Workers who can recall previously encountered potential employers in order to engage them in Bertrand bidding have a distinct advantage over workers without such attachments. Firms account for this...