Many goods and services are allocated through various booking systems. Queue-based booking systems are often thought to allocate goods more efficiently than random allocation because the time spent queuing signals an agent's valuation. This paper demonstrates that the opportunity cost of queuing...

We investigate fairness preferences in matching mechanisms using a spectator design. Participants choose between the Boston mechanism or the serial dictatorship mechanism (SD) played by others. In our setup, the Boston mechanism generates justified envy, while the strategy-proof SD ensures...

We study a robust mechanism design problem where a seller attempts to sell a single item to a single buyer, knowing only the moment and support information of the buyer's valuation distribution. The seller endeavors to maximize the competitive ratio with respect to the hindsight optimal policy...

We study the design of optimal Bayesian data acquisition mechanisms for a platform interested in estimating the mean of a distribution by collecting data from privacy-conscious users. In our setting, users have heterogeneous sensitivities for two types of privacy losses corresponding to local...