4 citations · 4 across the 9 of their papers we have counts for
12 papers
Scaling QAOA: transferring optimal adiabatic schedules from small-scale to large-scale variational circuits
Ugo Nzongani, Dylan Laplace Mermoud, Arthur Braida
The Quantum Approximate Optimization Algorithm (QAOA) is a leading approach for combinatorial optimization on near-term quantum devices, yet its scalability is limited by the diffi…
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…
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…
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…
On the Formation of Steady Coalitions
Dylan Laplace Mermoud
This paper studies the formation of the grand coalition of a cooperative game by investigating its possible internal dynamics. Each coalition is capable of forcing all players to r…
Combinatorics on Social Configurations
Dylan Laplace Mermoud, Pierre Popoli
In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in coopera…
Geometry of Set Functions in Game Theory: Combinatorial and Computational Aspects
Dylan Laplace Mermoud
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chap…
Diffusion in dynamic networks with time-varying inputs to allocate responsibility
Rosa van den Ende, Dylan Laplace Mermoud
Responsibility in complex networks extends beyond direct actions: players should also bear responsibility for the indirect effects within their supply chains or network. We introdu…