We consider two-stage "shortlisting procedures" in which the menu of alternatives is first pruned by some process or criterion and then a binary relation is maximized. Given a particular first-stage process, our main result supplies a necessary and sufficient condition for choice data to be...

We formulate and study a general finite-horizon bargaining game with simultaneous moves and a disagreement outcome that need not be the worst possible result for the agents. Conditions are identified under which the game is dominance solvable in the sense that iterative deletion of weakly...

We introduce and study the problem of manipulation of choice behavior. In a class of two-stage models of decision making, with the agent's choices determined by three "psychological variables," we imagine that a subset of these variables can be selected by a "manipulator." To what extent does...