A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria

DOI10.1515/amcs-2015-0043zbMath1322.91007OpenAlexW2261527979MaRDI QIDQ747538

David A. Rosenblueth, Pedro A. Góngora

Publication date: 16 October 2015

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2015-0043

zbMATH Keywords

shortest pathNash equilibriummodel checkingbinary decision diagram (BDD)Bellman-Ford

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Noncooperative games (91A10)

Related Items

A robust algorithm to solve the signal setting problem considering different traffic assignment approaches

Uses Software

• Gambit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• Symbolic model checking: \(10^{20}\) states and beyond
• On the use of binary decision diagrams for solving problems on simple games
• Generating BDDs for symbolic model checking in CCS
• Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
• Optimization and Multiobjective Control of Time-Discrete Systems
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Graph-Based Algorithms for Boolean Function Manipulation
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• Min-max Computation Tree Logic
• Branching time, perfect information games, and backward induction