When two or more self-interested agents put their plans to execution in the same environment, conflicts may arise as a consequence, for instance, of a common utilization of resources. In this case, an agent can postpone the execution of a particular action, if this punctually solves the conflict, or it can resort to execute a different plan if the agent's payoff significantly diminishes due to the action deferral. In this paper, we present a game-theoretic approach to non-cooperative planning that helps predict before execution what plan schedules agents will adopt so that the set of strategies of all agents constitute a Nash equilibrium. We perform some experiments and discuss the solutions obtained with our game-theoretical approach, analyzing how the conflicts between the plans determine the strategic behavior of the agents.
CITATION STYLE
Jordán, J., & Onaindia, E. (2015). Game-theoretic approach for non-cooperative planning. In Proceedings of the National Conference on Artificial Intelligence (Vol. 2, pp. 1357–1363). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9384
Mendeley helps you to discover research relevant for your work.