Weak order polytopes

Discrete Mathematics

Volumn 275, Issue 1-3, 2004, Pages 111-127

  Fiorini, S ^a   Fishburn, P C ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Choice probability; Polytope; Preference; Weak order

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; DECISION MAKING;

CHOICE PROBABILITY; POLYTOPES;

PROBABILITY;

EID: 0347985404     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00101-8     Document Type: Article

References (36)

1. Anscombe F., Aumann R. A definition of subjective probability. Ann. Math. Statist. 34:1963;199-205.
2. Arrow K.J. Social Choice and Individual Values. 2nd Edition:1963;Wiley, New York.
3. Bolotashvili G., Kovalev M., Girlich E. New facets of the linear ordering polytope. SIAM J. Discrete Math. 12:1999;326-336.
4. T. Christof, Porta - a polyhedron representation transformation algorithm, version 1.2.1, Universität Heidelberg, 1996, maintained by A. Loebel, M. Stoer (ZIB Berlin).
5. T. Christof, G. Reinelt, Efficient parallel facet enumeration for 0/1-polytopes, Technical report, Institut für Angewandte Mathematik, Universität Heidelberg, 1997.
6. Cohen M., Falmagne J.-C. Random utility representation of binary choice probabilities. a new class of necessary conditions J. Math. Psychol. 34:1990;88-94.
7. de Finetti B. La prévision: ses lois logiques, ses sources subjectives. Ann. Inst. H. Poincaré 7:1937;1-68. Translated by H.E. Kyburg as Foresight, its logical laws, its subjective sources, in: H.E. Kyburg, H.E. Smokler (Eds.), Studies in Subjective Probability, Wiley, New York, 1964.
8. de Finetti B. La prévision: ses lois logiques, ses sources subjectives. Ann. Inst. H. Poincaré 7:1937;1-68. Translated by H.E. Kyburg as Foresight, its logical laws, its subjective sources, in: H.E. Kyburg, H.E. Smokler (Eds.), Studies in Subjective Probability, Wiley, New York, 1964.
9. Doignon J.-P., Fiorini S. Facets of the weak ordering polytope derived from the induced partition projection. SIAM J. Discrete Math. 15:2002;112-121.
10. Dridi T. Sur les distributions binaires associées à des distributions ordinales. Math. Sci. Humaines. 69:1980;15-31.
11. S. Fiorini, Polyhedral combinatorics of order polytopes, Ph.D. Thesis, Université Libre de Bruxelles, Bruxelles, Belgium, 2001.
12. Fiorini S. Determining the automorphism group of the linear ordering polytope. Discrete Appl. Math. 112:2001;121-128.
13. Fishburn P. Utility Theory for Decision Making. 1970;Wiley, New York.
14. Fishburn P. The Theory of Social Choice. 1973;Princeton University Press, Princeton, NJ.
15. Fishburn P. Induced binary probabilities and the linear ordering polytope. a status report Math. Soc. Sci. 23:1992;67-80.
16. Gallai T. Transitiv orientierbare graphen. Acta Math. Hungar. 18:1967;25-66.
17. Gilboa I. A necessary but insufficient condition for the stochastic binary choice problem. J. Math. Psychol. 34:1990;371-392.
18. Grötschel M., Jünger M., Reinelt G. Acyclic subdigraph and linear orderings: polytopes, facets and a cutting plane algorithm. Rival I. Graphs and Order. 1985;217-264 Reidel, Dordrecht.
19. Grötschel M., Jünger M., Reinelt G. Facets of the linear ordering polytope. Math. Program. 33:1985;43-60.
20. M. Gurgel, Poliedros de grafos transitivos, Ph.D. Thesis, Universidade de São Paulo, São Paulo, Brazil, 1992.
21. Gurgel M., Wakabayashi Y. Adjacency of vertices of the complete pre-order polytope. Discrete Math. 175:1997;163-172.
22. Kelly D. Comparability graphs. Rival I. Graphs and Order. 1985;3-39 Reidel, Dordrecht.
23. Koppen M. Random utility representation of binary choice probabilities. critical graphs yielding critical necessary conditions J. Math. Psychol. 39:1995;21-39.
24. Leung J., Lee J. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. 50:1994;185-200.
25. Marschak J. Binary-choice constraints and random utility indicators. Arrow K., Karlin S., Suppes P. Mathematical Methods in the Social Sciences 1959. 1960;312-329 Stanford University Press, Stanford, CA.
26. Matsui T., Tamura S. Adjacency on combinatorial polyhedra. Discrete Appl. Math. 56:1995;311-321.
27. McConnell R.M., Spinrad J. Modular decomposition and transitive orientation. Discrete Math. 201:1999;189-241.
28. McFadden D., Richter M. Stochastic rationality and revealed stochastic preference. Chipman J., McFadden D., Richter M. Preferences, Uncertainty, and Optimality. 1990;161-186 Westview Press, Boulder, CO.
29. McLennan A. Binary stochastic choice. Chipman J., McFadden D., Richter M. Preferences, Uncertainty, and Optimality. 1990;187-202 Westview Press, Boulder, CO.
30. Möhring R. Algorithmic aspects of comparability graphs and interval graphs. Rival I. Graphs and Order. 1985;41-101 Reidel, Dordrecht.
31. Savage L.J. The Foundations of Statistics. 1954;Wiley, New York.
32. Thurstone L. A law of comparative judgment. Psychol. Rev. 34:1927;273-286.
33. von Neumann J., Morgenstern O. Theory of Games and Economic Behavior. 1944;Princeton University Press, Princeton, NJ.
34. Wakker P. Additive Representations of Preferences. 1989;Kluwer, Dordrecht.
35. Young H. On permutations and permutation polytopes. Math. Program. Study. 8:1978;128-140.
36. Ziegler G. Lectures on Polytopes. 1995;Springer, Berlin.