We characterize a class of dynamic stochastic games that we call separable dynamic games with noisy transitions and establish that these widely used models are protocol invariant provided that periods are sufficiently short. Protocol invariance means that the set of Markov perfect equilibria is...

While payoff-based learning models are almost exclusively devised for finite action games, where players can test every action, it is harder to design such learning processes for continuous games. We construct a stochastic learning rule, designed for games with continuous action sets, which...

Consider the problem of maximizing the revenue from selling a number of goods to a single buyer. We show that, unlike the case of one good, when the buyer's values for the goods increase the seller's maximal revenue may well decrease. We then identify two circumstances where monotonicity does...

Consider the problem of maximizing the revenue from selling a number of goods to a single buyer. We show that, unlike the case of one good, when the buyer's values for the goods increase the seller's maximal revenue may well decrease. We then identify two circumstances where monotonicity does...

This paper shows that belief-driven economic fluctuations are a general feature of many determinate macroeconomic models. In environments with hidden state variables, forecast-model misspecification can break the link between indeterminacy and sunspots by establishing the existence of...

Echenique, Lee, Shum, and Yenmez (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable (TU) and non-transferable utility (NTU) and for extremal stable matchings. In this paper, we rephrase their restrictions in terms of properties on a...

This paper develops a framework for studying repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers) in every period. I define history-dependent and...

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matching exists in a discrete matching market when firms' preference profile satisfies a...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...