In this paper the structure of the set of equilibria for two person multicriteria games is analysed. It turns out that the classical result for the set of equilibria for bimatrix games, that it is a finite union of polytopes, is only valid for multicriteria games if one of the players only has two pure strategies. A full polyhedral description of these polytopes can be derived when the player with an arbitrary number of pure strategies has one criterion
The famous Harsanyi's (1973) Theorem states that generically a finite game has an odd number of Nash...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those co...
In this paper the structure of the set of equilibria for two person multicriteria games is analysed....
Theory of multicriteria games is a special field of game theory, when one or more players have at le...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper, we propose new solution concepts for multicriteria games and compare them with existi...
Here we study the structure of Nash equilibrium points for N-person games. For two-person games we o...
This paper is a self-contained survey of algorithms for comput-ing Nash equilibria of two-person gam...
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
The maximal generic number of Nash equilibria for two person games in which the two agents each hav...
International audienceWe study the structure of the set of equilibrium payoffs in finite games, both...
minor corrections added November Abstract This paper is a selfcontained survey of algorithms for...
We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium ...
The famous Harsanyi's (1973) Theorem states that generically a finite game has an odd number of Nash...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those co...
In this paper the structure of the set of equilibria for two person multicriteria games is analysed....
Theory of multicriteria games is a special field of game theory, when one or more players have at le...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper, we propose new solution concepts for multicriteria games and compare them with existi...
Here we study the structure of Nash equilibrium points for N-person games. For two-person games we o...
This paper is a self-contained survey of algorithms for comput-ing Nash equilibria of two-person gam...
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
The maximal generic number of Nash equilibria for two person games in which the two agents each hav...
International audienceWe study the structure of the set of equilibrium payoffs in finite games, both...
minor corrections added November Abstract This paper is a selfcontained survey of algorithms for...
We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium ...
The famous Harsanyi's (1973) Theorem states that generically a finite game has an odd number of Nash...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
We introduce the notion of exchangeable equilibria of a symmetric bimatrix game, defined as those co...