Symmetry breaking for voting mechanisms

DOI10.1007/978-3-030-72904-2_12zbMath1474.68478OpenAlexW3147141284MaRDI QIDQ2233522

Andrew M. Sutton, Preethi Sankineni

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72904-2_12

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems
• Symmetry breaking revisited
• The one-dimensional Ising model: mutation versus recombination
• Generating effective symmetry-breaking predicates for search problems
• Beitrag zur Theorie des Ferromagnetismus
• The benefits and limitations of voting mechanisms in evolutionary optimisation
• Symmetry Breaking and Local Search Spaces

This page was built for publication: Symmetry breaking for voting mechanisms