Computability and logic
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
The independent choice logic for modelling multiple agents under uncertainty
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Computer science and the fine structure of Borel sets
Theoretical Computer Science
Topological properties of omega context-free languages
Theoretical Computer Science
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Automata Theory for Reasoning About Actions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Decision-Theoretic, High-Level Agent Programming in the Situation Calculus
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Inductive Definability and the Situation Calculus
ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Sequential von Neumann–Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. We show that sequential VM games with countably many actions and continuous utility functions have a sound and complete axiomatization in the situation calculus. This axiomatization allows us to represent game-theoretic reasoning and solution concepts such as Nash equilibrium. We discuss the application of various concepts from VM game theory to the theory of planning and multi-agent interactions, such as representing concurrent actions and using the Baire topology to define continuous payoff functions.