Towards Copeland optimization in combinatorial problems

DOI10.1007/978-3-031-08011-1_4zbMATH Open1504.91093OpenAlexW4285285335MaRDI QIDQ2170176FDOQ2170176

Authors: Sidhant Bhavnani, Alexander Schiendorfer 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_4

Recommendations

• A characterization of the Copeland solution
• The Copeland rule and Condorcet's principle
• The Copeland method. I: Relationships and the dictionary
• The Copeland choice function. An axiomatic characterization
• A distance-based comparison of basic voting rules

zbMATH Keywords

constraint programmingsocial choice theoryOR

Mathematics Subject Classification ID

Social choice (91B14) Combinatorial optimization (90C27)

Cites Work

• Essence: A constraint language for specifying combinatorial problems
• Handbook of constraint programming.
• Multicriteria Optimization
• The price of fairness
• Title not available (Why is that?)
• Handbook of Computational Social Choice
• Price of fairness for allocating a bounded resource
• Combining leximax fairness and efficiency in a mathematical programming model
• Lazy clause generation: combining the power of SAT and CP (and MIP?) solving

Cited In (7)

• Title not available (Why is that?)
• On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
• A group decision-making and optimization method based on relative inverse number
• Discovery Science
• Combinatorial optimization with interaction costs: complexity and solvable cases
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• A portable and scalable algorithm for a class of constrained combinatorial optimization problems

Uses Software

• MiniZinc
• Gecode
• Essence

This page was built for publication: Towards Copeland optimization in combinatorial problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170176)