理论经济学

Selection shapes all kinds of behaviors, including how we make decisions under uncertainty. The risk attitude reflected from it should be simple, flexible, yet consistent. In this paper we engaged evolutionary dynamics to find the decision…

The Condorcet Jury Theorem or the Miracle of Aggregation are frequently invoked to ensure the competence of some aggregate decision-making processes. In this article we explore an estimation of the prior probability of the thesis predicted…

I study dynamic random utility with finite choice sets and exogenous total menu variation, which I refer to as stochastic utility (SU). First, I characterize SU when each choice set has three elements. Next, I prove several mathematical…

The hawk-dove game admits two types of equilibria: an asymmetric pure equilibrium in which players in one population play hawk and players in the other population play dove, and an inefficient symmetric mixed equilibrium, in which hawks are…

We study Bayesian Persuasion with multiple senders who have access to conditionally independent experiments (and possibly others). Senders have zero-sum preferences over information revealed. We characterize when any set of states can be…

In this paper, we consider coordination and anti-coordination heterogeneous games played by a finite population formed by different types of individuals who fail to recognize their own type but do observe the type of their opponent. We show…

The existing studies on consumer search agree that consumers are worse-off when they do not observe sellers' production marginal cost than when they do. In this paper we challenge this conclusion. Employing a canonical model of simultaneous…

This paper extends the unified network model, proposed by Acemoglu et al. (2016b), such that interaction functions can be heterogeneous, and the sensitivity matrix has less than or equal to one spectral radius. We show the existence and…

We present some conditions for social preference transitivity under the majority rule when the individual preferences include cycles. First, our concern is with the restriction on the preference orderings of individuals except those (called…

This paper derives primitive, easily verifiable sufficient conditions for existence and uniqueness of (stochastic) recursive utilities for several important classes of preferences. In order to accommodate models commonly used in practice,…

We make a detailed analysis of three key algorithms (Serial Dictatorship and the naive and adaptive variants of the Boston algorithm) for the housing allocation problem, under the assumption that agent preferences are chosen iid uniformly…

We study the link between Phelps-Aigner-Cain-type statistical discrimination and familiar notions of statistical informativeness. Our central insight is that Blackwell's Theorem, suitably relabeled, characterizes statistical discrimination…

In pairwise interactions assortativity in cognition means that pairs where both decision-makers use the same cognitive process are more likely to occur than what happens under random matching. In this paper we study both the mechanisms…

Can cost-reducing technical change lead to a fall in the long run rate of profit if class struggle manages to keep the rate of exploitation constant? In a general circulating capital model, we derive sufficient conditions for cost-reducing…

We propose a finite automaton-style solution concept for supergames. In our model, we define an equilibrium to be a cycle of state switches and a supergame to be an infinite walk on states of a finite stage game. We show that if the stage…

We investigate how individuals form expectations about population behavior using statistical inference based on observations of their social relations. Misperceptions about others' connectedness and behavior arise from sampling bias…

Will people eventually learn the value of an asset through observable information? This paper studies observational learning in a market with competitive prices. Comparing a market with public signals and a market with private signals in a…

This paper introduces a unified framework for stable matching, which nests the traditional definition of stable matching in finite markets and the continuum definition of stable matching from Azevedo and Leshno (2016) as special cases.…

We study the complexity of closure operators, with applications to machine learning and decision theory. In machine learning, closure operators emerge naturally in data classification and clustering. In decision theory, they can model…

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…