A Decision Method for Temporal Logic Based on Resolution
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Dynamically Ordered Probabilistic Choice Logic Programming
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Choice Logic Programs and Nash Equilibria in Strategic Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A modal characterization of Nash equilibrium
Fundamenta Informaticae
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
| Hi-index | 0.00 |
We use linear time temporal logic formulas to model strategic and extensive form games. This allows us to use temporal tableau to reason about the game structure. We order the nodes of the tableau according to the players’ preferences. Using this, we can derive a decision procedure for reasoning about the equilibria of these games. The main result developed in this paper is that every finite game can be converted into an equivalent bargaining game on temporal tableau, where the players negotiate the equilbrium outcome. The decision method proposed in this paper has a number of merits compared to others that can be found in the growing literature connecting games to logic – it captures a wide variety of game forms, it is easy to understand and implement, and it can be enhanced to take into account bounded rationality assumptions.