Modeling and Reasoning about NTU Games via Answer Set Programming
نویسندگان
چکیده
A compact representation for non-transferable utility games founding on answer set programming is proposed. The representation is fully expressive, in that it can capture all games defined over a finite set of alternatives. Moreover, due to the knowledge representation capabilities of answer set programs, it can easily accommodate the definition of games within a wide range of application domains, ranging from scheduling, to routing and planning, just to name a few. The computational complexity of the proposed framework is studied, in particular, by focusing on the core as the prototypical solution concept. A system supporting the basic reasoning tasks arising therein is also made available, and results of experimental activity are discussed.
منابع مشابه
Planning in RTS Games with Incomplete Action Definitions via Answer Set Programming
Standard game tree search algorithms, such as minimax or Monte Carlo Tree Search, assume the existence of an accurate forward model that simulates the effects of actions in the game. Creating such model, however, is a challenge in itself. One cause of the complexity of the task is the gap in level of abstraction between the informal specification of the model and its implementation language. To...
متن کاملUsing Answer Set Programming for Solving Boolean Games
Boolean games are a framework for reasoning about the rational behaviour of agents, whose goals are formalized using propositional formulas. They offer an attractive alternative to normal-form games, because they allow for a more intuitive and more compact encoding. Unfortunately, however, there is currently no general, tailor-made method available to compute the equilibria of Boolean games. In...
متن کاملCoco: Runtime Reasoning about Conflicting Commitments
To interact effectively, agents must enter into commitments. What should an agent do when these commitments conflict? We describe Coco, an approach for reasoning about which specific commitments apply to specific parties in light of general types of commitments, specific circumstances, and dominance relations among specific commitments. Coco adapts answer-set programming to identify a maximal s...
متن کاملNon-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. In the classical Transferable Utility (TU) setting, coalition worths can be freely distributed amongst agents. However, in several application scenarios, this is not the case and the Non-Transfe...
متن کاملA Multi-Agent Platform using Ordered Choice Logic Programming
Multi-agent systems (MAS) can take many forms depending on the characteristics of the agents populating them. Amongst the more demanding properties with respect to the design and implementation is how these agents may individually reason and communicate about their knowledge and beliefs, with a view to cooperation and collaboration. In this paper we present a deductive reasoning multi-agent pla...
متن کامل