An efficient heuristic search algorithm for discovering large Condorcet domains
From MaRDI portal
Cites work
- \({\mathcal Q}\)-learning
- A family of Condorcet domains that are single-peaked on a circle
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- A Possibility Theorem on Majority Decisions
- Acyclic sets of linear orders
- Acyclic sets of linear orders via the Bruhat orders
- Acyclic sets of linear orders: a progress report
- Condorcet domains of tiling type
- Condorcet domains on at most seven alternatives
- Condorcet domains satisfying Arrow's single-peakedness
- Constructing large peak-pit Condorcet domains
- Discovering faster matrix multiplication algorithms with reinforcement learning
- How Large are Transitive Simple Majority Domains?
- scientific article; zbMATH DE number 5556709 (Why is no real title available?)
- scientific article; zbMATH DE number 3225500 (Why is no real title available?)
- Maximal Condorcet domains
- Maximal Condorcet domains. A further progress report
- On the likelihood of single-peaked preferences
- Reinforcement learning for combinatorial optimization: a survey
- Structured preferences: a literature survey
- Symmetric maximal Condorcet domains
- The largest Condorcet domain on 8 alternatives
This page was built for publication: An efficient heuristic search algorithm for discovering large Condorcet domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964784)
