Skip to Main content Skip to Navigation

Constraint games revisited

Anthony Palmieri 1
1 Equipe CODAG - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : 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.
Complete list of metadatas

Cited literature [256 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Saturday, November 16, 2019 - 1:04:37 AM
Last modification on : Monday, February 10, 2020 - 3:49:26 PM
Document(s) archivé(s) le : Monday, February 17, 2020 - 12:30:48 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02366533, version 1


Anthony Palmieri. Constraint games revisited. Computer Science and Game Theory [cs.GT]. Normandie Université, 2019. English. ⟨NNT : 2019NORMC207⟩. ⟨tel-02366533⟩



Record views


Files downloads