Conditions for Transitivity of Majority Rule with Algorithmic Interpretations.

Abstract

Using particular cases of the condition Ref (nu,i,j) (in Koelher 1978), one can derive nine conditions for transitivity of the method of majority decision which all possess a generating algorithm with possible sociological or economical interpretations. Some celebrated conditions appear to be particular cases of this structure. Some other, 'new conditions,' at least new under their algorithmic form, suggest explanation for some efficient committee votings. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA111673

Entities

People

  • Herve Raynaud

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Combinatorial Analysis
  • Contracts
  • Econometrics
  • Economics
  • Efficiency
  • Investments
  • Military Research
  • New York
  • Sequences
  • Social Sciences
  • Trees (Data Structures)
  • United States
  • Universities

Readers

  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design