Voting paradoxes and diagraphs realizations

Advances in Applied Mathematics

Volumn 29, Issue 1, 2002, Pages 126-135

  Alon, Noga ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036657895     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00007-6     Document Type: Article

References (12)

1. N. Alon, L. Babai, A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7 (1986) 567-583.
2. N. Alon, J.H. Spencer, The Probabilistic Method, second edition, Wiley, New York, 2000.
3. W.F. de la Vega, On the maximal cardinality of a consistent set of arcs in a random tournament, J. Combin. Theory Ser. B 35 (1983) 328-332.
4. P. Erdos, L. Moser, On the representation of directed graphs as unions of orderings, Magyar Tud. Akad. Mat. Kutató Int. Közl. 9 (1964) 125-132.
5. P. Fishburn, The Theory of Social Choice, Princeton University Press, 1973.
6. G. Hurlbert, H. Kierstead, in preparation.
7. G. Kalai, Social choice and threshold phenomena, in preparation.
8. R. Latała, K. Oleszkiewicz, On the best constant in the Khinchin-Kahana inequality, Studia Math. 109 (1994) 101-104.
9. D.C. McGarvey, A theorem on the construction of voting paradoxes, Econometrica 21 (1953) 608-610.
10. J. Spencer, Optimal ranking of tournaments, Networks 1 (1971) 135-138.
11. R. Stearns, The voting problem, Amer. Math. Monthly 66 (1959) 761-763.
12. S.J. Szarek, On the best constants in the Khinchin Inequality, Studia Math. 58 (1976) 197-208.