Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
From MaRDI portal
Cites work
- A Consistent Extension of Condorcet’s Election Principle
- A new approach for identifying the Kemeny median ranking
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- An Axiomatic Theory of Tournament Aggregation
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- Comparing Top k Lists
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Handbook of social choice and welfare. Vol. 1.
- scientific article; zbMATH DE number 3976693 (Why is no real title available?)
- scientific article; zbMATH DE number 653035 (Why is no real title available?)
- Induced binary probabilities and the linear ordering polytope: A status report
- Preservation of properties of fuzzy relations during aggregation processes
- Rank aggregation: together we're strong
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The median procedure in cluster analysis and social choice theory
- The original Borda count and partial voting
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Voting schemes for which it can be difficult to tell who won the election
This page was built for publication: Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139170)
