Skip to main content

Ordered Sets and Social Sciences

  • Conference paper
Ordered Sets

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 83))

Abstract

Problems of modeling, of analysis and of aggregation of preferences provide important examples to illustrate the connections between ordered sets and social sciences. We review these problems according to a three-level classification: order models of preferences; order and associated metric structures of sets of preferences; aggregation of preferences. We conclude with examples connected with dimensionality of partial orders and lattice fixed point problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • M. Aigner (1969) “Graphs and binary relations”, in The many facets of graph theory, 1–21, New York, Springer Verlag.

    Google Scholar 

  • W.E. Armstrong (1939) “The determinateness of the utility function”, Economics Journal, 49, 453–467.

    Google Scholar 

  • K.J. Arrow (1962) Social choice and individual values, 2nd ed., J. Wiley and Sons, New York (first edition, 1951).

    Google Scholar 

  • S.P. Avann (1961) “Application of the join-irreducible excess function to semi-modular lattices”, Math. Annalen, 142, 345–354.

    MathSciNet  MATH  Google Scholar 

  • S.P. Avann (1972) “The lattice of natural partial orders”, Aequationes Math., 8, 95–102.

    MathSciNet  MATH  Google Scholar 

  • M. Barbut (1961) “Médiane, distributivité, éloignements”, Publications du Centre de Mathématique Sociale, E.P.H.E$16ème section, Paris and Math. Sci. Hum. 70 (1980), 5–31.

    Google Scholar 

  • M. Barbut (1967) “Médianes, Condorcet et Kendall”, note SEMA, Paris and Math Sci. Hum. 69 (1980), 5–13.

    Google Scholar 

  • M. Barbut (1967) “Echelles à distance minimum d’une partie donnée d’un treillis distributif fini, Math. Sci. Hum. 18, 41–46.

    MathSciNet  Google Scholar 

  • M. Barbut (edit. 1971) Ordres totaux finis, Mouton, Paris.

    Google Scholar 

  • M. Barbut and B. Monjardet (1970) Ordre et classification, Algèbre et Combinatoire, 2 tomes, Paris, Hachette.

    MATH  Google Scholar 

  • J.P. Barthélemy (1978) “Remarques sur les propriétés métriques des ensembles ordonnés”, Math. Sci. Hum. 61, 39–60.

    MATH  Google Scholar 

  • J.P. Barthélemy (1979) “Caractérisations axiomatiques de la distance de la différence métrique entre des relations binaires”, Math. Sci. Hum. 67, 85–113.

    MATH  Google Scholar 

  • J.P. Barthélemy (1980) “An asymptotic equivalent for the number of total preorders on a finite set”, Discrete Mathematics 29, 311–313.

    MathSciNet  MATH  Google Scholar 

  • J.P. Barthélemy (1982) “Arrow’s theorem: unusual domains and extended codomains”, in P.K. Pattanaik and M. Salles (eds.) Social choice and welfare, North Holland, Amsterdam.

    Google Scholar 

  • J.P. Barthélemy and B. Monjardet (1981) “The median procedure in cluster analysis and social choice theory”, Math. Soc. Sci. 1, 3, 235–267.

    MATH  Google Scholar 

  • G. Birkhoff (1967) Lattice theory, 3rd ed., Providence, Amer. Math. Soc.

    Google Scholar 

  • G. Birkhoff and S.A. Kiss “A ternary operation in distributive lattices”, Bull. Amer. Math. Soc. 53, 749–752.

    Google Scholar 

  • D. Black (1958) The theory of Committees and Elections, Cambridge University Press, London.

    MATH  Google Scholar 

  • D.H. Blair and R.A. Pollak (1979) “Collective rationality and dictatorship: the scope of the Arrow theorem”, J. Econ. Theory 21, 1, 186–194.

    MathSciNet  MATH  Google Scholar 

  • J.K. Blau (1979) “Semiorders and collective choice”, J. Econ. Theory 21, 1, 195–206.

    MathSciNet  MATH  Google Scholar 

  • K.P. Bogart (1973) “Preference structures I: Distance between transitive preference relations”, J. Math. Sociol., 3, 49–67.

    MathSciNet  MATH  Google Scholar 

  • K.P. Bogart (1973) “Preference structures II: Distances between asymmetric relations”, SIAM J. Appl. Math., 29, 2, 254–262.

    MathSciNet  Google Scholar 

  • K.P. Bogart (1982) “Some social science applications of ordered sets”, Symp. Ordered Sets (I. Rival, ed.) Reidel, Dordrecht-Boston, 759–787.

    Google Scholar 

  • K.P. Bogart and W.T. Trotter, Jr (1973) “Maximal dimensional partially ordered sets II.” Characterization of 2n-element posets with dimension n, Diserete Mathematics, 5, 33–43.

    MathSciNet  MATH  Google Scholar 

  • K.P. Bogart, I. Rabinovitch and W.T. Trotter, Jr. (1976) “Abound on the dimension of interval orders”, J. Combinatorial Theory, A21, 319–328.

    MathSciNet  MATH  Google Scholar 

  • S.A. Boorman and P. Arabie (1972) “Structural measures and the method of sorting” in Multidimensional Scaling, vol. 1, Theory, Seminar Press, New York.

    Google Scholar 

  • S.A. Boorman and D.C.Olivier (1973) “Metrics on spaces of finite trees”, J. of Math. Psychol., 10, 26–29.

    MathSciNet  MATH  Google Scholar 

  • J.C. Borda (1784) “Mémoire sur les élections au scrutin”, Histoire de l’Académie Royale des Sciences pour 1781, Paris, English translation by A. de Grazia, Isis, 44 (1953).

    Google Scholar 

  • G. Bordes (1981) “Procédures d’agrégation et fonctions de choix”, in P. Batteau, E. Jacquet-Lagrèze and B. Monjardet, eds., Analyse et agrégation des préférences, Economica, Paris.

    Google Scholar 

  • A. Bouchet (1971) Étude combinatoire des ordonnés finis, thèse d’état, Université Scientifique et Médicale de Grenoble.

    Google Scholar 

  • G. Boulaye (1968) “Notion d’extension dans les treillis”, Revue roumaine Mathématiques pures et appliquées, 13, 9, 1225–1231.

    MathSciNet  MATH  Google Scholar 

  • J.L. Chandon, J. Lemaire and J. Pouget (1978) “Dénombrement des quasi-ordres sur un ensemble fini”, Math. Sci. Hum, 62, 61–80.

    MathSciNet  MATH  Google Scholar 

  • R.P. Dilworth (1940) “Lattice with unique irreducible representation”, Ann. of Math., 41, 2, 771–777.

    MathSciNet  Google Scholar 

  • J.S. Chipman (1971) “Consumption theory without transitive indifference”, in Preferences, Utility and Demand, Harcourt Brace, New York.

    Google Scholar 

  • O. Cogis (1980) La dimension Ferrers des graphes orientés, Thesis, Université P. et M. Curie, Paris.

    Google Scholar 

  • O. Cogis (1981) “On the Ferrers dimension of a digraph”. Discrete Mathematics, to appear.

    Google Scholar 

  • Marquis de Condorcet (1785) Essai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix, Paris, (reprint, Chelsea Publ. 6, New York, 1974).

    Google Scholar 

  • C.H. Coombs (1964) A theory of data, Wiley, New York.

    Google Scholar 

  • P. Cousot and R. Cousot (1977) Constructive versions of Tarski’s fixed point theorems, Grenoble, Univ. Sci. Med.

    Google Scholar 

  • R.A. Dean and F. Keller (1968) “Natural partial orders”, Canad. J. Math., 20, 535–554.

    MathSciNet  MATH  Google Scholar 

  • A. Degenne (1972) Techniques ordinales en analyse des données: Statistique, Hachette, Paris.

    MATH  Google Scholar 

  • A. Degenne, C. Flament and P. Verges (1978) “Approche galoisienne en classification”, Statistiques et Analyse des données, 29–34.

    Google Scholar 

  • J.P. Doignon, A. Ducamp and J.C. Falmagne (1981) “The bidimension of a relation”, Colloque international sur la théorie des graphes et la combinatoire, Luminy.

    Google Scholar 

  • A. Ducamp and J.C. Falmagne (1969) “Composite measurement”, J. Mathematical Psychology, 6, 359–390.

    MathSciNet  MATH  Google Scholar 

  • V. Duquenne (1980) Quelques aspects algébriques du traitement de données planifiées, third cycle thesis, Université René Descartes.

    Google Scholar 

  • P.H. Edelman (1980) “Meet-distributive lattices and the anti-exchange closure”, Algebra Universalis, 10, 290–299.

    MathSciNet  MATH  Google Scholar 

  • P.H. Edelman and P. Klingsberg (1981) “The subposet lattice and the order polynomial”, discussion paper.

    Google Scholar 

  • J.C. Falmagne (1980) “Bi-orders and bi-order dimension of a partial order”, 11th European Mathematical Psychology Meeting, Liège.

    Google Scholar 

  • J.M. Faverge (1965), Méthodes statistiques en psychologie appliquée: tome III, Presses Universitaires de France, Paris.

    Google Scholar 

  • T. Fine (1970) “Extrapolation when very little is known”, Information and control, 16, 331–360.

    MathSciNet  MATH  Google Scholar 

  • P.C. Fishburn (1970a) “Intransitive indifference in preference theory: a survey”, Operations Research, 18, 2, 207–228.

    MathSciNet  MATH  Google Scholar 

  • P.C. Fishburn (1970b) Utility theory for decision making, New York, Wiley.

    MATH  Google Scholar 

  • P.C. Fishburn (1971) “Betweenness, orders and interval graphs”, J. Pure Appl. Algebra, 1, 2, 159–178.

    MathSciNet  MATH  Google Scholar 

  • P.C. Fishburn (1972) Mathematics of decision theory, Mouton, the Hague.

    MATH  Google Scholar 

  • P.C. Fishburn (1973) The theory of the social choice, Princeton University Press, New Jersey.

    MATH  Google Scholar 

  • P.C. Fishburn (1975) “Semiorders and choice functions”, Econometrica, 43, 5–6, 975–977.

    MathSciNet  MATH  Google Scholar 

  • P.C. Fishburn (1979) “Transitivity” Review of Economic Studies 46, 1, 163–173.

    MathSciNet  MATH  Google Scholar 

  • P.C. Fishburn (1981a) “Maximum semiorders in interval orders”, SIAM J. Alg. Disc. Meth. 2, 2.

    Google Scholar 

  • P.B. Fishburn (1981b) “Restricted thresholds for interval orders: a class of nonfinite axiomatizability”, preprint.

    Google Scholar 

  • P.C. Fishburn and W.V. Gehrlein (1975) “A comparative analysis of methods for constructing weak orders from partial orders”, J. Math. Sociol., 4, 1, 93–102.

    MathSciNet  MATH  Google Scholar 

  • Cl. Flament (1963) Applications of graph theory to group structure, Prentice Hall, New York.

    MATH  Google Scholar 

  • Cl. Flament (1962) “L’analyse de similitude”, Cahiers du Centre de Recherche Opérationnelle, 4, 2, 63–97.

    MathSciNet  MATH  Google Scholar 

  • Cl. Flament (1976) L’analyse booléenne de questionnaires, Mouton, Paris.

    Google Scholar 

  • Cl. Flament (1978) “Un théorème de point fixe dans les treillis”, Mathématiques et Sciences Humaines, 61, 61–64.

    MathSciNet  MATH  Google Scholar 

  • Cl. Flament (1979) “Un modèle des jugements de similitude”, Math. et Sci. Hum., 65, 5–21.

    MathSciNet  MATH  Google Scholar 

  • C. Frey (1971) Technique ordinale en analyse des données, algèbre et combinatoire, Hachette, Paris.

    Google Scholar 

  • W. Gaertner and M. Salles (1981) “Procédures d’agrégation avec domaines restreints” in Analyse et agrégation des préférences (Eds. P. Batteau, E. Jacquet-Lagrèze, B. Monjardet) Economica, Paris.

    Google Scholar 

  • E.H. Galanter (1956) “An axiomatic and experimental study of sensory order and measure”, Psychological Review, 63, 16–28.

    Google Scholar 

  • M.C. Golumbic (1980) Algorithmic graph theory and perfect graphs, Academic Press, New York.

    MATH  Google Scholar 

  • M. Gonzalez (1978) L’organisation des préférences et les jugements comparatifs, third cycle thesis, Université de Paris X.

    Google Scholar 

  • N. Goodman (1951) Structure of appearance, Cambridge, Mass., Harvard University Press.

    Google Scholar 

  • T.L. Greenough and K.P. Bogart (1979) “The representation and enumeration of interval orders”, to appear.

    Google Scholar 

  • G. Th. Guilbaud (1952) “Les théories de l’intérét général et le problème logique de l’agrégation”, Economie appliquée, 5, 4, 1952 reprinted in Élements de la théorie des jeux, Dunod, Paris, 1968, English Transl, in Readings in Mathematical Social Sciences, Science Research Associates, Chicago, 262–307.

    Google Scholar 

  • G. Th. Guilbaud (1962) “Continu expérimental et continu mathématique”, notes de cours et Math. Sci. Hum., 62, 11–33 (1978).

    MATH  Google Scholar 

  • G. Th. Guilbaud and J.P. Rosenstiehl (1963) “Analyse algébrique d’un scrutin”, Math. Sci. Hum. 4, 9–33.

    Google Scholar 

  • E. Halphen (1953) “La notion de vraisemblance”, Publications de l’I.S.U.P., 4, 1, 41–92.

    MathSciNet  Google Scholar 

  • L. Haskins and S. Gudder (1972) “Height on posets and graphs”, Discrete Math. 2, 357–382.

    MathSciNet  MATH  Google Scholar 

  • D. Hausmann and B. Korte (1978) “Adjacency on 0-1 polyhedra” Polyhedral Combinatorics, edited by M.L. Balinski and A.J. Hoffman, North Holland, New York, 106–127.

    Google Scholar 

  • L. Hubert (1974) “Some applications of graph theory and related non-metric-techniques to problems of approximate seriation: the case of symmetric proximity measures”, Br. J. Math. Statist. Psychol., 27, 2, 133–153.

    MATH  Google Scholar 

  • E. Jacquet-Lagrèze (1975a) “How we can use the notion of semi-orders to build outranking relations in multicriteria decision making”, in Utility subjective probability and human decision making, ed. c. Vlek et P. Wendt, D. Reidel, et Metra 13, 1, (1974) 59–86.

    Google Scholar 

  • E. Jacquet-Lagrèze (1975b) La modélisation des préférences: préordres, quasi-ordres et relations floues, third cycle Thesis, Université Paris V.

    Google Scholar 

  • D.T. Jamison and L.J. Lau (1973) “Semiorders and the theory of choice”, Econometrica, 41, 901–902.

    MathSciNet  MATH  Google Scholar 

  • D.T. Jamison and L.J. Lau (1977) “The nature of equilibrium with semi-ordered preferences”, Econometrica, 45, 7, 595–605.

    MathSciNet  Google Scholar 

  • E. Jacquet-Lagrèze and B. Roy (1981) “Aide à la décision multi-critères et systèmes relationnels de préférence” in P. Batteau, E. Jacquet-Lagrèze and B. Monjardet (eds) Analyse et agrégation des préférence, Economica, Paris.

    Google Scholar 

  • M.F. Janowitz (1978) “An order theoretic model for cluster analysis, SIAM J. Appl. Math., 34, 1, 55–72.

    MathSciNet  MATH  Google Scholar 

  • M.F. Janowitz (1979) “Monotone equivariant cluster methods”, SIAM J. Applied Mathematics, 37, 148–165.

    MathSciNet  MATH  Google Scholar 

  • J.S. Kelly (1978) Arrow impossibility theorems, New York, Academic Press.

    MATH  Google Scholar 

  • J.G. Kemeny (1959) “Mathematics without numbers”, Daedalus 88, 577–591.

    Google Scholar 

  • J.G. Kemeny and J.C. Snell (1962) Mathematical models in the social sciences, Ginn and Co., New York.

    MATH  Google Scholar 

  • D.G. Kendall (1969) “Incidence matrices, interval graphs, and seriation in archaeology”, Pacific J. Math., 28, 565–570.

    MathSciNet  MATH  Google Scholar 

  • M.G. Kendall (1962) Rank correlation methods, 3rd ed., Hafner, New York (first ed. 1948 ).

    Google Scholar 

  • Y. Kergall (1974) “Étude des tresses de Guttman en algèbre à p valeurs”, Math. Sci. Hum., 46.

    Google Scholar 

  • D.H. Krantz, R.D. Luce, P. Suppes and A. Tversky (1971) Foundations of measurement, vol. 1, Academic Press, New York.

    MATH  Google Scholar 

  • B. Ledere (1981) “Description combinatoire des ultramétriques”, Math. Sci. Rum. 73, 5–37.

    Google Scholar 

  • S. Leinhardt (edit. 1977) Social networks: a developing paradigm, Academic Press, New York.

    Google Scholar 

  • R.D. Luce (1956) “Semiorders and a theory of utility discrimination”, Econometrica, 24, 178–191.

    MathSciNet  MATH  Google Scholar 

  • R.D. Luce, R.R. Bush and E. Galanter (1963–1965) Handbook of mathematical psychology, 3 vol., Wiley, New York.

    MATH  Google Scholar 

  • H. Maehara (1980) “On time graphs”, Discrete Mathematics 32, 281–289.

    MathSciNet  MATH  Google Scholar 

  • J.F. Marcotorchino and P. Michaud (1979) Optimisation en analyse ordinale des données, Masson, Paris.

    Google Scholar 

  • A. Mas-Collel and H. Sonnenschein (1972) “General possibility theorems for group decision”, The Review of Economic Studies, 39, 185–192.

    Google Scholar 

  • B. G. Mirkin (1972) “Description of some relations on the set of real-line intervals”, J. Math. Psychol., 9, 243–252.

    MathSciNet  MATH  Google Scholar 

  • B.G. Mirkin (1974) “The problems of approximation in space of relations and qualitative data analysis”, Automatika i Telemechanika translated in Automation and Remote control, 35, 9, 1424–1491.

    Google Scholar 

  • B.G. Mirkin (1979) Group choice, Editor P.C. Fishburn, V.H. Winston and Sons, Washington (Russian edit., 1974).

    Google Scholar 

  • B.G. Mirkin and K.B. Cherny (1970) “On measurement of distance between partitions of a finite set of units”, Automatika i Telemechanika, transl, in Automation and Remote Control, 31, 5, 786–792.

    Google Scholar 

  • B. Monjardet (1975) “Tournois et ordres médians pour une opinion”, Math. Sci. Hum., 43, 55–70.

    MathSciNet  Google Scholar 

  • B. Monjardet (1976) “Caractérisations métriques des ensembles ordonnés semi-modulaires”, Math. Sci. Hum., 56, 77–87.

    MathSciNet  Google Scholar 

  • B. Monjardet (1978a) “An axiomatic theory of tournament aggregation”, Math. Oper. Research, 3, 4, 334–351.

    MathSciNet  MATH  Google Scholar 

  • B. Monjardet (1978b) “Axiomatiques et propriétés des quasi-ordres”, Math. Sci. Hum., 63, 51–82.

    MathSciNet  MATH  Google Scholar 

  • B. Monjardet (1980) “Théorie et applications de la médiane dans les treillis distributifs finis”, Annals of Discrete Math., 9, 87–91.

    MathSciNet  MATH  Google Scholar 

  • B. Monjardet (1981) “Metrics on partially ordered sets — a survey”, Discrete Mathematics, 35, 173–184.

    MathSciNet  MATH  Google Scholar 

  • J.W. Moon (1979) “Some enumeration problems for similarity relations”, Discrete Mathematics, 26, 3, 251–260.

    MathSciNet  MATH  Google Scholar 

  • Y.K. Ng (1977) “Sub-semiorder. A model of multidimensional choice with preference intransitivity”, J. Math. Psychol., 16, 1, 51–59.

    Google Scholar 

  • O. Ore (1962) Theory of graphs, Chapter 11, American Mathematical Society Providence.

    Google Scholar 

  • I. Rabinovitch (1978a) “The dimension of semiorders”, J. Comb. Th. (A), 25, 50–61.

    MathSciNet  MATH  Google Scholar 

  • I. Rabinovitch (1978b) “An upper bound on the dimension of interval orders”, J. Comb. Th. (A), 25, 68–71.

    MathSciNet  MATH  Google Scholar 

  • F. Restle (1959) “A metric and an ordering on sets”, Psychometrika, 24–207–220.

    Google Scholar 

  • J. Riguet (1950) “Les relations de Ferrers, C.B. Acad. Sei. Fr., 231, 936–937.

    MathSciNet  MATH  Google Scholar 

  • F.S. Roberts (1970) “On nontransitive indifference”, J. Math. Psychol. 7, 243–258.

    MATH  Google Scholar 

  • F.S. Roberts (1976) Discrete mathematical models with applications to social, biological and environmental problems, New York, Prentice Hall.

    MATH  Google Scholar 

  • F.S. Roberts (1978) Graph theory and its applications to problems of society, Philadelphia, SIAM.

    Google Scholar 

  • F.S. Roberts (1979) Measurement theory, Addison Wesley.

    MATH  Google Scholar 

  • D.G. Rogers (1977) “Similarity relations on finite ordered sets”, J. Comb. Th. (A), 23, 88–99.

    MATH  Google Scholar 

  • D.G. Rogers, K.H. Kim and F.W. Roush (1979) “Similarity relations and semiorders” 10th Southeastern Conference on Combinatorics, Graph theory and Computing, Baton Rouge

    Google Scholar 

  • M. Roubens and Ph. Vincke (1980) “Représentation et ajustement des ordres d’intervalle”, discussion paper, Faculté Polytechnique de Mons.

    Google Scholar 

  • B. Roy and P. Bertier (1979) “La méthode ELECTRE II, une application au media-planning”, M. Ross (Ed.) OR 72, North Holland Publishing Company.

    Google Scholar 

  • B. Roy and Ph. Vincke (1980) “Systèmes relationnels de préférences en présence de critères multiples avec seuils”, Cahier du Centre d’Etudes de Becherche Opérationnelle, 22, 1.

    MathSciNet  Google Scholar 

  • M. Schader (1980), “Hierarchical analysis: classification with ordinal object dissimilarities”, Metrika, 27, 127–132.

    MathSciNet  MATH  Google Scholar 

  • M. Schader (1981) Scharfe und unscharfe Klassifikation qualitativer Daten, Verlags-gruppe Anthenäum, Hain, Scriptor, Hanstein.

    MATH  Google Scholar 

  • B.M. Schein (1972) “A representation theorem for lattices”, Algebra Universalis, 2, 2, 177–178.

    MathSciNet  MATH  Google Scholar 

  • D. Scott and P. Suppes (1958) “Foundational aspects of theories of measurement”, J. Symbolic Logic, 23, 113–128.

    MathSciNet  Google Scholar 

  • A.K. Sen (1970) Collective choice and social welfare, Oliver and Boyd, London.

    MATH  Google Scholar 

  • H. Sharp Jr (1971–1972) “Enumeration of transitive, step-type relations”, Acta Math. Acad. Sci. Bum., 22, 365–371.

    MathSciNet  Google Scholar 

  • S. Shye (Edit. 1978) Theory construction and data analysis in the behavioral sciences, Jossey-Bass, San Francisco.

    Google Scholar 

  • W.T. Trotter Jr and J.I. Moore Jr (1976) “Characterization problems for graphs, partially ordered sets, lattices and families of sets”, Discrete Math., 16, 361–381.

    MathSciNet  Google Scholar 

  • A. Tversky (1969) “The intransitivity of preferences”, Psychol. Review, 76, 31–48.

    Google Scholar 

  • P. Vincke (1978) “Quasi-ordres généralisés et représentation numérique”, Math. Sci. Hum., 62, 35–60.

    MathSciNet  MATH  Google Scholar 

  • N. Wiener (1912–1914) “Contribution to the theory of relative position”, Proc. Cambridge Philos. Soc., 17, 441–449.

    Google Scholar 

  • N. Wiener (1914–1916) “A new theory of measurement: a study in the logic of mathematics”, Proc. London Math. Soc. 19, 181–205.

    Google Scholar 

  • R.L. Wine and J.E. Freund (1957) “On the enumeration of decision patterns involving n means”, Ann. Math. Statist., 28, 256–259.

    MathSciNet  MATH  Google Scholar 

  • H.P. Young (1974) “An axiomatization of Borda’s rule”, J. Econ. Theory, 9, 43–52.

    Google Scholar 

  • H.P. Young,(1978) “On permutations and permutation polytopes”, in Polyhedral combinatorics, editors M.L. Balinski and A.J. Hoffman, North Holland, Amsterdam.

    Google Scholar 

  • H.P. Young and A. Levenglick (1978) “A consistent extension of Condorcet’s election principle”, SIAM J. Appl. Math., 35, 2, 285–300.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this paper

Cite this paper

Barthélemy, J.P., Flament, C., Monjardet, B. (1982). Ordered Sets and Social Sciences. In: Rival, I. (eds) Ordered Sets. NATO Advanced Study Institutes Series, vol 83. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7798-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7798-3_23

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7800-3

  • Online ISBN: 978-94-009-7798-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics