In a class of informed principal problems with common values often used in applications we de…fine a particular mechanism which we call the assured allocation. It is always undominated, i.e. efficient among the different types of the principal. We show it is a perfect Bayesian equilibrium...

Analytic Hierarchy Process (AHP) is one of the most popular multi-attribute decision aid methods. However, results depend on the preference measurement sacle and the aggregation technique used. In this paper, we describe a decision problem with an inherent trade-off between two criteria. A...

We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game—a game where all players have two pure strategies and a common utility function with values either zero or...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules robust. The search literature employs optimal rules based on cutoff strategies, and these rules are not robust. We derive...

-

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules robust. The search literature employs optimal rules based on cutoff strategies, and these rules are not robust. We derive...