Publication
Quantifying Commitment in Nash Equilibria
Related publications (51)
New Perspectives on Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimization
Daniel Kuhn, Florian Dörfler, Soroosh Shafieezadeh Abadeh
We study optimal transport-based distributionally robust optimization problems where a fictitious adversary, often envisioned as nature, can choose the distribution of the uncertain problem parameters by reshaping a prescribed reference distribution at a f ...
2023Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update
Efstratios Panteleimon Skoulakis
In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...
2022Bandit Online Learning of Nash Equilibria in Monotone Games
We address online bandit learning of Nash equilibria in multi-agent convex games. We propose an algorithm whereby each agent uses only obtained values of her cost function at each joint played action, lacking any information of the functional form of her c ...
2021Mixed Nash Equilibria in the Adversarial Examples Game
This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum game formed by the attacker and the classifier. While previous works usually al ...
2021Normalized Gaussian path integrals
Path integrals play a crucial role in describing the dynamics of physical systems subject to classical or quantum noise. In fact, when correctly normalized, they express the probability of transition between two states of the system. In this work, we show ...
AMER PHYSICAL SOC2020Quantifying Commitment in Nash Equilibria
To quantify a player's commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a "canonical extension," which allows each player to adjust his or her move with a certain probability. The commitment meas ...
2019Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation
Daniel Kuhn, Viet Anh Nguyen, Soroosh Shafieezadeh Abadeh, Wolfram Wiesemann
The likelihood function is a fundamental component in Bayesian statistics. However, evaluating the likelihood of an observation is computationally intractable in many applications. In this paper, we propose a non-parametric approximation of the likelihood ...
2019Statistical Aspects of Wasserstein Distances
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in order to recover th ...
ANNUAL REVIEWS2019Robust Multidimensional Pricing: Separation without Regret
Daniel Kuhn, Napat Rujeerapaiboon, Cagil Kocyigit
We study a robust monopoly pricing problem with a minimax regret objective, where a seller endeavors to sell multiple goods to a single buyer, only knowing that the buyer's values for the goods range over a rectangular uncertainty set. We interpret this pr ...
2018Finding Mixed Nash Equilibria of Generative Adversarial Networks
Volkan Cevher, Ya-Ping Hsieh, Chen Liu
We reconsider the training objective of Generative Adversarial Networks (GANs) from the mixed Nash Equilibria (NE) perspective. Inspired by the classical prox methods, we develop a novel algorithmic framework for GANs via an infinite-dimensional two-player ...
2018