In this paper, we describe a novel iterative procedure called SISTA to learn the underlying cost in optimal transport problems. SISTA is a hybrid between two classical methods, coordinate descent ("S"-inkhorn) and proximal gradient descent ("ISTA"). It alternates between a phase of exact...

We consider non-cooperative environments in which two players have the power to commit but cannot sign binding agreements. We show that by committing to a set of actions rather than to a single action, players can implement a wide range of action profiles. We give a complete characterization of...

This paper generalizes the concept of Bayes correlated equilibrium (Bergemann and Morris, 2016) to multi-stage games. We apply our characterization results to a number of illustrative examples and applications.

We derive necessary and sufficient conditions for data sets composed of state-contingent prices and consumption to be consistent with two prominent models of decision making under uncertainty: variational preferences and smooth ambiguity. The revealed preference conditions for subjective...

We study the repeated implementation of social choice functions in environments with complete information and changing preferences. We define dynamic monotonicity, a natural but nontrivial dynamic extension of Maskin monotonicity, and show that it is necessary and almost sufficient for repeated...

We consider multi-stage games, where at each stage, players receive private signals about past and current states, past actions and past signals, and choose actions. We fully characterize the distributions over actions, states, and signals that obtain in any (sequential) communication...

Consider a finite data set where each observation consists of a bundle of contingent consumption chosen by an agent from a constraint set of such bundles. We develop a general procedure for testing the consistency of this data set with a broad class of models of choice under risk and under...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially...