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...
We develop an efficient algorithm for computing pure strategy Nash equilibria that satisfy various c...
There is a fundamental connection between the notions of game and of computation. At its most basic ...
In this paper we study distributed algorithms for computing a Nash Equilibrium in potential games.Ou...
This thesis revisits the Constraint games framework by rethinking their solving technique in terms o...
This thesis presents a topic at the interface of game theory and constraint programming. More precis...
International audienceConstraint Games are a recent framework proposed to model and solve static gam...
International audienceGame Theory studies situations in which multiple agents having conflicting obj...
International audienceGame theory is a highly successful paradigm for strategic decision making betw...
International audienceFor a variety of automated collective decision systems, Pure Nash Equilibria [...
Summary. This paper addresses the application of distributed constraint optimization problems (DCOPs...
This paper presents a new way to map a Constraint Satisfaction Problem (CSP) onto a non-cooperative ...
This paper introduces a parameterisation of learning algorithms for distributed constraint optimisat...
In this paper, we consider algorithms for distributed constraint op-timisation problems (DCOPs). Usi...
This thesis focuses on potential games and a generalized load balancing game in a graph we called pl...
National audienceLa Théorie des Jeux étudie des situations dans lesquelles de multiples agents ayant...
We develop an efficient algorithm for computing pure strategy Nash equilibria that satisfy various c...
There is a fundamental connection between the notions of game and of computation. At its most basic ...
In this paper we study distributed algorithms for computing a Nash Equilibrium in potential games.Ou...
This thesis revisits the Constraint games framework by rethinking their solving technique in terms o...
This thesis presents a topic at the interface of game theory and constraint programming. More precis...
International audienceConstraint Games are a recent framework proposed to model and solve static gam...
International audienceGame Theory studies situations in which multiple agents having conflicting obj...
International audienceGame theory is a highly successful paradigm for strategic decision making betw...
International audienceFor a variety of automated collective decision systems, Pure Nash Equilibria [...
Summary. This paper addresses the application of distributed constraint optimization problems (DCOPs...
This paper presents a new way to map a Constraint Satisfaction Problem (CSP) onto a non-cooperative ...
This paper introduces a parameterisation of learning algorithms for distributed constraint optimisat...
In this paper, we consider algorithms for distributed constraint op-timisation problems (DCOPs). Usi...
This thesis focuses on potential games and a generalized load balancing game in a graph we called pl...
National audienceLa Théorie des Jeux étudie des situations dans lesquelles de multiples agents ayant...
We develop an efficient algorithm for computing pure strategy Nash equilibria that satisfy various c...
There is a fundamental connection between the notions of game and of computation. At its most basic ...
In this paper we study distributed algorithms for computing a Nash Equilibrium in potential games.Ou...