In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if payoffs range over a partially ordered set instead of the reals, then the backward induction predicate does no longer imply the Nash equilibrium predicate. Non-determinism is a solution: a suitable non-deterministic backward induction function returns a non-deterministic strategy profile which is a non-deterministic Nash equilibrium. The main notions and results in this article are constructive, conceptually simple and formalised in the proof assistant Coq
We present two alternative definitions of Nash equilibrium for two person games in the presence af u...
Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. Ther...
We prove the existence of equilibria in games with players who employ abstract (non-binary) choice r...
International audienceIn sequential games of traditional game theory, backward induction guarantees ...
Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed tha...
Abstract. We generalize the well-known backward induction procedure to the case of extensive games w...
We present a method of backward induction for computing approximate subgame perfect Nash equilibria ...
Using techniques from higher-type computability theory and proof theory we extend the well-known gam...
In 1953, Kuhn showed that every sequential game has a Nash equilibrium by showing that a procedure, ...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
I introduce axiomatically infinite sequential games that extend Kuhn’s classical framework. Infinite...
Backward Induction is a fundamental concept in game theory. As an algorithm, it can only be used to ...
Doxastic characterizations of the set of Nash equilibrium outcomes and of the set of backward-induct...
This chapter of the Handbook of Game Theory (Vol. 3) provides an overview of the theory of Nash equi...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
We present two alternative definitions of Nash equilibrium for two person games in the presence af u...
Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. Ther...
We prove the existence of equilibria in games with players who employ abstract (non-binary) choice r...
International audienceIn sequential games of traditional game theory, backward induction guarantees ...
Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed tha...
Abstract. We generalize the well-known backward induction procedure to the case of extensive games w...
We present a method of backward induction for computing approximate subgame perfect Nash equilibria ...
Using techniques from higher-type computability theory and proof theory we extend the well-known gam...
In 1953, Kuhn showed that every sequential game has a Nash equilibrium by showing that a procedure, ...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
I introduce axiomatically infinite sequential games that extend Kuhn’s classical framework. Infinite...
Backward Induction is a fundamental concept in game theory. As an algorithm, it can only be used to ...
Doxastic characterizations of the set of Nash equilibrium outcomes and of the set of backward-induct...
This chapter of the Handbook of Game Theory (Vol. 3) provides an overview of the theory of Nash equi...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
We present two alternative definitions of Nash equilibrium for two person games in the presence af u...
Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. Ther...
We prove the existence of equilibria in games with players who employ abstract (non-binary) choice r...