Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games.Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of...

In this paper reasonable payoff intervals for players in a game in partition function form (p.f.f.game) are introduced and used to define the notion of compromisable p.f.f. game.For a compromisable p.f.f. game a compromise value is defined for which an axiomatic characterization is provided.Also...

In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a...

It is shown that in team games, i.e. in games in which all players have the same payoff function, the risk-dominant equilibrium may differ from the Pareto dominant one.

In this paper a simple and basic signaling game is studied in an experimental environment. First, we check whether we can replicate some of the findings in the literature concerning equilibrium selection and the use and impact of costly signals. Second, and foremost, the comparative statics...