Daniel Kuhn, Napat Rujeerapaiboon, Cagil Kocyigit
We study a robust auction design problem with a minimax regret objective, where a seller seeks a mechanism for selling multiple items to multiple anonymous bidders with additive values. The seller knows that the bidders' values range over a box uncertainty ...
2024
