5 papers
On the closest balanced game
Pedro García-Segador, Michel Grabisch, Dylan Laplace Mermoud +1
Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the…
Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Ugo Nzongani, Dylan Laplace Mermoud, Giuseppe Di Molfetta +1
We introduce SamBa-GQW, a novel quantum algorithm for solving binary combinatorial optimization problems of arbitrary degree with no use of any classical optimizer. The algorithm i…
Minimal balanced collections and their applications to core stability and other topics of game theory
Dylan Laplace Mermoud, Michel Grabisch, Peter Sudhölter
Minimal balanced collections are a generalization of partitions of a finite set of n elements and have important applications in cooperative game theory and discrete mathematics. H…
Attraction of the core and the cohesion flow
Dylan Laplace Mermoud
We adopt a continuous-time dynamical system approach to study the evolution of the state of a game driven by the willingness to reduce the total dissatisfaction of the coalitions a…
Projection onto the core: An optimal reallocation to correct market failure
Dylan Laplace Mermoud
This paper provides formulae and algorithms to compute the projection onto the core of a preimputation outside it. The core of a game is described using an exponential number of li…