معرفی
Dylan Laplace Mermoud is a Postdoctoral Researcher in the Department of Applied Mathematics at ENSTA Paris. His research focuses on Algebraic Combinatorics, Quantum Computing, and Cooperative Game Theory. He explores topics such as social organization structures through operad theory, core stability in game-theoretic frameworks, and variational quantum algorithms for combinatorial problems. His work bridges abstract algebraic methods with practical applications in network dynamics and optimization.
His research interests span the intersection of mathematics and social sciences, particularly in modeling cooperative systems and analyzing network-based decision-making processes. He contributes to both theoretical advancements and computational tools for solving complex combinatorial challenges, including applications in quantum computing and market equilibrium correction.
Key research trends in his publications include the algebraic foundations of social configurations, algorithmic approaches to core stability, and quantum algorithm design for permutation-based problems. His work emphasizes interdisciplinary applications, such as optimizing resource allocation in dynamic networks and developing frameworks for understanding steady coalition formation in game-theoretic contexts.
