Publication
Distributional Robustness in Mechanism Design
Publications associées (85)
Probabilistic Tracklet Scoring and Inpainting for Multiple Object Tracking
Mathieu Salzmann, Fatemehsadat Saleh
Despite the recent advances in multiple object tracking (MOT), achieved by joint detection and tracking, dealing with long occlusions remains a challenge. This is due to the fact that such techniques tend to ignore the long-term motion information. In this ...
IEEE COMPUTER SOC2021Trajectory planning under environmental uncertainty with finite-sample safety guarantees
We tackle the problem of trajectory planning in an environment comprised of a set of obstacles with uncertain time-varying locations. The uncertainties are modeled using widely accepted Gaussian distributions, resulting in a chance-constrained program. Con ...
2021Distributionally Robust Mechanism Design
Daniel Kuhn, Cagil Kocyigit, Wolfram Wiesemann
We study a mechanism design problem where an indivisible good is auctioned to multiple bidders, for each of whom it has a private value that is unknown to the seller and the other bidders. The agents perceive the ensemble of all bidder values as a random v ...
2020Wasserstein Distributionally Robust Learning
Many decision problems in science, engineering, and economics are affected by uncertainty, which is typically modeled by a random variable governed by an unknown probability distribution. For many practical applications, the probability distribution is onl ...
EPFL2020Fractional extreme distributions
We consider three classes of linear differential equations on distribution functions, with a fractional order alpha is an element of [0; 1]. The integer case alpha = 1 corresponds to the three classical extreme families. In general, we show that there is a ...
2020Scalable Stochastic Optimization: Scenario Reduction with Guarantees
Stochastic optimization is a popular modeling paradigm for decision-making under uncertainty and has a wide spectrum of applications in management science, economics and engineering. However, the stochastic optimization models one faces in practice are int ...
EPFL2020Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions
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 ...
2020Strong convergence of multivariate maxima
Simone Padoan, Stefano Rizzelli
It is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We ex ...
CAMBRIDGE UNIV PRESS2020Sublinear Bounds on the Distinguishing Advantage for Multiple Samples
The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source is distributed according to distribution or , when given access to one sample of , is characterized by the statistical distance ...
Springer, Cham2020No-Regret Learning from Partially Observed Data in Repeated Auctions
Maryam Kamgarpour, Orcun Karaca
We study a general class of repeated auctions, such as the ones found in electricity markets, as multi-agent games between the bidders. In such a repeated setting, bidders can adapt their strategies online using no-regret algorithms based on the data obser ...
2020