Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Non-Determinism and ...
Conference paper

Non-Determinism and Nash Equilibria for Sequential Game over Partial Order

Stéphane Le Roux (1) (2)
(1) Laboratoire de l'Informatique du Parallélisme
(2) Japan Advanced Institute of Science and Technology
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AF, Computational Logic and Applications (CLA '05)
Proceedings
DOI
10.46298/dmtcs.3468
License
https://about.hal.science/hal-authorisation-v1
Indicators
604
Views
496
Downloads

Non-Determinism and Nash Equilibria for Sequential Game over Partial Order

Stéphane Le Roux (1) (2)
(1) Laboratoire de l'Informatique du Parallélisme
(2) Japan Advanced Institute of Science and Technology
Abstract
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.
Keywords
  • [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
  • [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
  • Nash equilibrium
  • sequential game
  • non-determinism
  • partial order
  • constructive
  • proof assistant
Cited by

Source: OpenCitations

  • Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence

    Lecture notes in computer science

    Authors : Stéphane Le Roux

    Journal reference : Volume , 2009, pp. 293-309

    DOI : 10.1007/978-3-642-03359-9_21
Preview
Loading PDF preview...