In congestion games, players use facilities from a common pool. The benefit that a player derives from using a facility depends, possibly among other things, on the number of users of this facility. The paper gives an easy alternative proof of the isomorphism between exact potential games and...

Pareto equilibria in multicriteria games can be computed as the Nash equilibria games, obtained by assigning weights to the separate criteria of a player. To analysts, these weights are usually unknown. This paper therefore proposes ideal equilibria, strategy profiles that are robust against...

A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.

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...

Behavioral economics provides several motivations for the common observation that agents appear somewhat unwilling to deviate from recent choices.More recent choices can be more salient than other choices, or more readily available in the agent's mind.Alternatively, agents may have formed...

We study boundedly rational players in an interactive situation. Each player follows a simple choice procedure in which he reacts optimally against a combination of actions of his opponents drawn at random from the distribution generated by a player's beliefs. By imposing a consistency...