scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

optimal solutions social choice theory single-peakedness \(n\)-round tournament implicit assignment incompatible axiomatic system multicriterial situation

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Social choice (91B14) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01)

Related Items (61)

Extending tournament solutions ⋮ How mathematical impossibility changed welfare economics: a history of Arrow's impossibility theorem ⋮ A comparison between the prudent order and the ranking obtained with Borda's, Copeland's, Slater's and Kemeny's rules ⋮ A new proposal for fusing individual preference orderings by rank-ordered agents: a generalization of the Yager's algorithm ⋮ Welfare criteria from choice: an axiomatic analysis ⋮ Multiple objective decision making for Lokahi (balance) in environmental management ⋮ The probability of Condorcet cycles and super majority rules ⋮ Multicriteria decision systems for financial problems ⋮ Social multi-criteria evaluation: methodological foundations and operational consequences ⋮ Analysis of the third European survey on working conditions with composite indicators ⋮ The probability of intransitivity of pairwise comparisons in individual preference ⋮ Selecting predictors for traffic control by methods of the mathematical theory of democracy ⋮ Minimal extending sets in tournaments ⋮ Three practical criteria of comparison among ordinal preference aggregating rules ⋮ Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning ⋮ Multiple‐criteria decision aid: Some epistemological considerations ⋮ The conflict analysis method: Bridging the gap between ELECTRE, PROMETHEE and ORESTE ⋮ Intensity of preference and related uncertainty in non-compensatory aggregation rules ⋮ Towards a theory of MCDM: Stepping away from social choice theory ⋮ A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method ⋮ Une typologie des méthodes multicritères: Proposition d'un cadre méthodologique ⋮ Query complexity of tournament solutions ⋮ Using scoring functions in a group decision-making procedure with heterogeneous experts and qualitative assessments ⋮ Maximum distance between Slater orders and Copeland orders of tournaments ⋮ Minimal stable sets in tournaments ⋮ Finding sharper distinctions for conditions of transitivity of the majority method. ⋮ A method based on multiobjective optimization for deriving a ranking from a fuzzy preference relation. ⋮ Minimal retentive sets in tournaments ⋮ Voting Procedures, Complexity of ⋮ Predicting DAX trends from Dow Jones data by methods of the mathematical theory of democracy ⋮ On the solution of \(w\)-stable sets ⋮ Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking ⋮ The solution of generalized stable sets and its refinement ⋮ A conflict analysis approach for illuminating distributional issues in sustainability policy ⋮ A novel algorithm for fusing preference orderings by rank-ordered agents ⋮ Characterizations of the 3-cycle count and backward length of a tournament ⋮ Accentuating the rank positions in an agreement index with reference to a consensus order ⋮ Lexicographically-ordered constraint satisfaction problems ⋮ A characterization of prudent choices ⋮ Extremal Restriction, Condorcet Sets, and Majority Decision Making ⋮ Robustness in Multi-criteria Decision Aiding ⋮ The ordinal input for cardinal output approach of non-compensatory composite indicators: the PROMETHEE scoring method ⋮ On the choice of weights for aggregating judgments in non-negotiable AHP group decision making ⋮ A prudent characterization of the ranked pairs rule ⋮ Static vector optimization in welfare economics ⋮ Robust bounds on choosing from large tournaments ⋮ Statistical comparison of aggregation rules for votes ⋮ Special issue: Decision-aid to improve organisational performance. Selected papers based on the presentation at the Canadian Opererational Research Society and Optimization Day (CORS-AD 2001), Québec City, Canada, May 6--9, 2001, and 3rd Francophones Days of Operations Research (Journées francophones de recherche opérationnelle), FRANCORO III, Québec City, Canada, May 9--12, 2001. ⋮ Omnipotence in stretchable two-dimensional scaling ⋮ The OR's prize winner and the software ARGOS: How a multijudge and multicriteria ranking GDSS helps a jury to attribute a scientific award ⋮ Extensions of the prudence principle to exploit a valued outranking relation ⋮ A formula for incorporating weights into scoring rules ⋮ A characterization of the prudent order preference function ⋮ On \(\lambda\)-majority voting paradoxes ⋮ A new approach for identifying the Kemeny median ranking ⋮ A Bibliographic Survey of the Activities and International Nature of Multiple Criteria Decision Making ⋮ A quest for fundamental theorems of social choice ⋮ Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner ⋮ Robust bounds on choosing from large tournaments ⋮ Bounds on the disparity and separation of tournament solutions ⋮ Axiomatic characterizations of threshold choice functions for comparison functions.

This page was built for publication: