A simultaneous pooled auction with multiple bids and preference lists is a way to auction multiple objects, in which bidders simultaneously express a bid for each object and a preference ordering over which object they would like to get in case they have the highest bid on more than one object....

A simultaneous pooled auction with multiple bids and preference lists is a way to auction multiple objects, in which bidders simultaneously express a bid for each object and a preference ordering over which object they would like to get in case they have the highest bid on more than one object....

For reward-based crowdfunding, we introduce the strategy-proof Generalized Moulin-Shenker mechanism (GMS) and compare its performance to the prevailing All-Or-Nothing mechanism (AON). Theoretically, GMS outperforms AON in equilibrium profit and funding success. We test these predictions...

In a laboratory experiment, we compare two auction mechanisms that determine the sequence of service to queued customers. In the server-initiated auction, the server, when idle, sells the right to be served next to the highest bidding customer in the queue and distributes the proceeds among the...

For reward-based crowdfunding, we introduce the strategy-proof Generalized Moulin-Shenker mechanism (GMS) and compare its performance to the prevailing All-Or-Nothing mechanism (AON). Theoretically, GMS outperforms AON in equilibrium profit and funding success. We test these predictions...

For reward-based crowdfunding, we introduce the strategy-proof Generalized Moulin-Shenker mechanism (GMS) and compare its performance to the prevailing All-Or-Nothing mechanism (AON). Theoretically, GMS outperforms AON in equilibrium profit and funding success. We test these predictions...

For reward-based crowdfunding, we introduce the strategy-proof Generalized Moulin-Shenker mechanism (GMS) and compare its performance to the prevailing All-Or-Nothing mechanism (AON). Theoretically, GMS outperforms AON in equilibrium profit and funding success. We test these predictions...

In a laboratory experiment, we compare two auction mechanisms that determine the sequence of service to queued customers. In the server-initiated auction, the server, when idle, sells the right to be served next to the highest bidding customer in the queue and distributes the proceeds among the...