Constraint Games revisited

Autor: Anthony Palmieri, Arnaud Lallouet
Přispěvatelé: Huawei Technologies France [Boulogne-Billancour], Equipe CODAG - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Normandie Université (NU)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)
Jazyk: angličtina
Rok vydání: 2017
Předmět:
Zdroj: International Joint Conference on Artificial Intelligence, IJCAI 2017
International Joint Conference on Artificial Intelligence, IJCAI 2017, Aug 2017, Melbourne, Australia. pp.729-735, ⟨10.24963/ijcai.2017/101⟩
IJCAI
DOI: 10.24963/ijcai.2017/101⟩
Popis: This thesis revisits the Constraint games framework by rethinking their solving technique in terms of constraint propagation.Players preferences are considered as global constraints making transparently the integration in constraints solvers.It yields not only a more elegant but also a more efficient framework.We release our new solver ConGA in open source.Our new complete solver is faster than previous state-of-the-art and is able to find all pure Nash equilibrium for some problems with 200 players or even with 2000 players in graphical games.This new perspective enables us to tackle real-worlds Telecommunication problems.This problem is solved with a centralized perspective and a decentralized one.The comparison of the two last approaches is really important to evaluate the quality of service in multi-users application, but computationally consuming.That is why, we propose new techniques in order to improve the resolution process.
Databáze: OpenAIRE
načítá se...