• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Nested Monte-Carlo Search for Multi-Agent Coalitions Mechanism With Constraints

Thumbnail
View/Open
Arib2015.pdf (598.1Kb)
Date
2015
Notes
Lecture Notes in Computer Science book series (LNCS, volume 9426)
Dewey
Intelligence artificielle
Sujet
Multi-agent systems; Coalition formation; Coordination; Negotiation
DOI
http://dx.doi.org/10.1007/978-3-319-26181-2_8
Conference name
9th International Workshop on Multi-disciplinary Trends in Artificial Intelligence (MIWAI 2015)
Conference date
11-2015
Conference city
Fuzhou
Conference country
China
Book title
Multi-disciplinary Trends in Artificial Intelligence
Author
Bikaki, Antonis; Zheng, Xianghan
Publisher
Springer
ISBN
978-3-319-26181-2
Book URL
10.1007/978-3-319-26181-2
URI
https://basepub.dauphine.fr/handle/123456789/20848
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Arib, Souhila
Aknine, Souhila
Cazenave, Tristan
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Item number of pages
80-88
Abstract (EN)
This paper develops and evaluates a coalition mechanism that enables agents to participate in concurrent tasks achievement in competitive situations in which agents have several constraints. Here we focus on situations in which the agents are self-interested and have not a priori knowledge about the preferences of their opponents, and they have to cooperate in order to reach their goals. All the agents have their specific constraints and this information is private. The agents negotiate for coalition formation (CF) over these constraints, that may be relaxed during negotiations. They start by exchanging their constraints and making proposals, which represent their acceptable solutions, until either an agreement is reached, or the negotiation terminates. We explore two techniques that ease the search of suitable coalitions: we use a constraint-based model and a heuristic search method. We describe a procedure that transforms these constraints into a structured graph on which the agents rely during their negotiations to generate a graph of feasible coalitions. This graph is therefore explored by a Nested Monte-Carlo search algorithm to generate the best coalitions and to minimize the negotiation time.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.