Y. Luo and L. Bölöni

Children in the forest: towards a canonical problem of spatio-temporal collaboration


Cite as:

Y. Luo and L. Bölöni. Children in the forest: towards a canonical problem of spatio-temporal collaboration. In The Sixth Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS 07), pp. 986–993, 2007.

Download:

Download 

Abstract:

Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most important challenges of the real world problems being modeled. Such examples are the block world for planning, two-player games for algorithms which learn the behavior of the opponent agent, or the ``split the pie'' game for a large class of negotiation problems. In this paper we focus on negotiating collaboration in space and time, a problem with many important real world applications. Although technically a multi-issue negotiation, we show that the problem can not be represented in a satisfactory manner by the split the pie model. We propose the ``children in the rectangular forest'' (CRF) model as a possible canonical problem for negotiating spatio-temporal collaboration. By exploring a centralized and a peer-to-peer negotiation based solution, we demonstrate that the problem captures the main challenges of the real world problems while allows us to simplify away some of the computationally demanding but semantically marginal features of real world problems.

BibTeX:

@inproceedings{Luo-2007-AAMAS,
    author = "Y. Luo and L. B{\"o}l{\"o}ni",
    title = "Children in the forest: towards a canonical problem of spatio-temporal
 collaboration",
    booktitle = "The Sixth Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS 07)",
    year = "2007",
    mynote = "Acceptance rate, full papers: 22\%",
    pages = "986-993",
    abstract = {
       Canonical problems are simplified representations of a class of real
       world problems. They allow researchers to compare algorithms in a
       standard setting which captures the most important challenges of the real
       world problems being modeled. Such examples are the block world for
       planning, two-player games for algorithms which learn the behavior of the
       opponent agent, or the ``split the pie'' game for a large class of
       negotiation problems.
       In this paper we focus on negotiating collaboration in space and time, a
       problem with many important real world applications. Although technically
       a multi-issue negotiation, we show that the problem can not be
       represented in a satisfactory manner by the split the pie model. We
       propose the ``children in the rectangular forest'' (CRF) model as a
       possible canonical problem for negotiating spatio-temporal collaboration.
       By exploring a centralized and a peer-to-peer negotiation based solution,
       we demonstrate that the problem captures the main challenges of the real
       world problems while allows us to simplify away some of the
       computationally demanding but semantically marginal features of real
       world problems.
    }
}

Generated by bib2html.pl (written by Patrick Riley, Lotzi Boloni ) on Fri Oct 06, 2017 18:15:24