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

DOI10.1515/AMCS-2015-0043zbMATH Open1322.91007OpenAlexW2261527979MaRDI QIDQ747538FDOQ747538

Authors: Pedro Arturo Góngora, David A. Rosenblueth 

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

Recommendations

• The complexity of subgame perfect equilibria in quantitative reachability games
• scientific article; zbMATH DE number 7649921
• Subgame perfection for equilibria in quantitative reachability games
• scientific article; zbMATH DE number 6767615
• Equilibrium computation for two-player games in strategic and extensive form

zbMATH Keywords

model checkingNash equilibriumshortest pathbinary decision diagram (BDD)Bellman-Ford

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Nonmonotone game labellings
• Programming and Verifying Subgame-Perfect Mechanisms
• A robust algorithm to solve the signal setting problem considering different traffic assignment approaches

Uses Software

• Gambit

This page was built for publication: A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747538)