A planner wants to elicit information about an agent's preference relation, but not the entire ordering. Specifically, preferences are grouped into "types", and the planner only wants to elicit the agent's type. We first assume beliefs about randomization are subjective, and show that a space of...

The rational inattention literature is split between two versions of the model: in one, mutual information of states and signals are bounded by a hard constraint, while, in the other, it appears as an additive term in the decision maker's utility function. The resulting constrained and...

Inspired by the social psychology literature, we study the implications of categorical thinking on decision making in the context of a large normal form game. Every agent has a categorization (partition) of her opponents and can only observe the average behavior in each category. A strategy...

We consider a random-matching model in which every agent has a categorization (partition) of his potential opponents. In equilibrium, the strategy of each player is a best response to the distribution of actions of his opponents in each category of his categorization. We provide equivalence...

We consider a random-matching model in which every agent has a categorization (partition) of his potential opponents. In equilibrium, the strategy of each player i is a best response to the distribution of strategies of his opponents (when they face i) in each category of his categorization. We...

We study the efficiency of categorization of other agents as a way of saving cognitive resources in the settings of a large normal-form game. We assume that, when an agent categorizes (partitions) her opponents, she only has information about the average strategy in each category. A strategy...

We propose a new geometric approach for the analysis of cooperative games. A cooperative game is viewed as a real valued function $u$ defined on a finite set of points in the unit simplex. We define the \emph{concavification} of $u$ on the simplex as the minimal concave function on the simplex...

We present a model of categorization based on prototypes. A prototype is an image or template of an idealized member of the category. Once a set of prototypes is defined, entities are sorted into categories on the basis of the prototypes they are closest to. We provide a characterization of...