4 citations · 4 across the 9 of their papers we have counts for
5 papers · 1 filter
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…
The algebraic structures of social organizations: the operad of cooperative games
Dylan Laplace Mermoud, Victor Roca i Lucio
The main goal of this paper is to settle a conceptual framework for cooperative game theory in which the notion of composition/aggregation of games is the defining structure. This…
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…
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
Dylan Laplace Mermoud, Andrea Simonetto, Sourour Elloumi
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction o…