Converting MA-PDDL to extensive-form games

Dániel L. Kovács, T. Dobrowiecki

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper presents algorithms for converting multi-agent planning (MAP) problems described in Multi-Agent Planning Domain Definition Language (MA-PDDL) to extensive-form games in order to analyse and solve them with game-theoretic tools in general. MA-PDDL is an attempt to standardize the description of MAP problems similarly to PDDL in the single-agent setting. In this paper MA-PDDL is extended with partial-observability and probabilistic-effects to model more realistic domains. The conversion is fruitful in both ways: 1) extensive-form games can be solved via game-theoretic solution concepts (e.g. Nash-equilibrium) providing solutions to corresponding MAP problems in general, and 2) MA-PDDL problems can be solved via MAP methods providing solutions to corresponding games. Both cooperative and non-cooperative solutions can be achieved.

Original languageEnglish
Pages (from-to)27-47
Number of pages21
JournalActa Polytechnica Hungarica
Volume10
Issue number8
Publication statusPublished - 2013

Fingerprint

Planning
Observability

Keywords

  • Game theory
  • Multi-agent
  • Partial observability
  • Pddl
  • Planning
  • Probabilistic

ASJC Scopus subject areas

  • General
  • Engineering(all)

Cite this

Converting MA-PDDL to extensive-form games. / Kovács, Dániel L.; Dobrowiecki, T.

In: Acta Polytechnica Hungarica, Vol. 10, No. 8, 2013, p. 27-47.

Research output: Contribution to journalArticle

Kovács, Dániel L. ; Dobrowiecki, T. / Converting MA-PDDL to extensive-form games. In: Acta Polytechnica Hungarica. 2013 ; Vol. 10, No. 8. pp. 27-47.
@article{9afd67e810b94068b33ae3efc4214ccd,
title = "Converting MA-PDDL to extensive-form games",
abstract = "This paper presents algorithms for converting multi-agent planning (MAP) problems described in Multi-Agent Planning Domain Definition Language (MA-PDDL) to extensive-form games in order to analyse and solve them with game-theoretic tools in general. MA-PDDL is an attempt to standardize the description of MAP problems similarly to PDDL in the single-agent setting. In this paper MA-PDDL is extended with partial-observability and probabilistic-effects to model more realistic domains. The conversion is fruitful in both ways: 1) extensive-form games can be solved via game-theoretic solution concepts (e.g. Nash-equilibrium) providing solutions to corresponding MAP problems in general, and 2) MA-PDDL problems can be solved via MAP methods providing solutions to corresponding games. Both cooperative and non-cooperative solutions can be achieved.",
keywords = "Game theory, Multi-agent, Partial observability, Pddl, Planning, Probabilistic",
author = "Kov{\'a}cs, {D{\'a}niel L.} and T. Dobrowiecki",
year = "2013",
language = "English",
volume = "10",
pages = "27--47",
journal = "Acta Polytechnica Hungarica",
issn = "1785-8860",
publisher = "Obuda University",
number = "8",

}

TY - JOUR

T1 - Converting MA-PDDL to extensive-form games

AU - Kovács, Dániel L.

AU - Dobrowiecki, T.

PY - 2013

Y1 - 2013

N2 - This paper presents algorithms for converting multi-agent planning (MAP) problems described in Multi-Agent Planning Domain Definition Language (MA-PDDL) to extensive-form games in order to analyse and solve them with game-theoretic tools in general. MA-PDDL is an attempt to standardize the description of MAP problems similarly to PDDL in the single-agent setting. In this paper MA-PDDL is extended with partial-observability and probabilistic-effects to model more realistic domains. The conversion is fruitful in both ways: 1) extensive-form games can be solved via game-theoretic solution concepts (e.g. Nash-equilibrium) providing solutions to corresponding MAP problems in general, and 2) MA-PDDL problems can be solved via MAP methods providing solutions to corresponding games. Both cooperative and non-cooperative solutions can be achieved.

AB - This paper presents algorithms for converting multi-agent planning (MAP) problems described in Multi-Agent Planning Domain Definition Language (MA-PDDL) to extensive-form games in order to analyse and solve them with game-theoretic tools in general. MA-PDDL is an attempt to standardize the description of MAP problems similarly to PDDL in the single-agent setting. In this paper MA-PDDL is extended with partial-observability and probabilistic-effects to model more realistic domains. The conversion is fruitful in both ways: 1) extensive-form games can be solved via game-theoretic solution concepts (e.g. Nash-equilibrium) providing solutions to corresponding MAP problems in general, and 2) MA-PDDL problems can be solved via MAP methods providing solutions to corresponding games. Both cooperative and non-cooperative solutions can be achieved.

KW - Game theory

KW - Multi-agent

KW - Partial observability

KW - Pddl

KW - Planning

KW - Probabilistic

UR - http://www.scopus.com/inward/record.url?scp=84885773474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885773474&partnerID=8YFLogxK

M3 - Article

VL - 10

SP - 27

EP - 47

JO - Acta Polytechnica Hungarica

JF - Acta Polytechnica Hungarica

SN - 1785-8860

IS - 8

ER -