References

Meta XRepublic

 
Bibliography
August 2002

References

1 Barbera, S. The manipulation of social choice mechanisms that do not leave ``too much'' to chance. Econometrica 45, 7 (October 1977), 1573-1588.

2 Benaloh, J., and Tuinstra, D. Receipt-free secret-ballot elections. In Proccedings of the Twenty-sixth Annual ACM Symposium on the Theory of Computing (May 23-25, 1994), pp. 544-553.

3 Brams, S. J., and Fishburn, P. C. Approval Voting. Birkhauser, Boston, 1983.

4 Brams, S. J., and Fishburn, P. C. Does approval voting elect the lowest common denominator? PS: Political Science 21 (Spring 1988), 277-284.

5 Brams, S. J., and Merrill, III, S. Would Ross Perot have won the 1992 Presidential election under approval voting? New York Univeristy C.V. Starr Center for Applied Economics Economic Research Report #93-30, July 1993.

6 Brams, S. J., and Nagel, J. H. Approval voting in practice. Public Choice 71 (August 1991), 1-17.

7 Cain, B. E. Strategic voting in Britain. American Journal of Political Science 22, 3 (August 1978), 639-655.

8 Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 2 (1981), 84-88.

9 Chaum, D. Security without identification: transaction systems to make big brother obsolete. Communications of the ACM 28, 10 (1985), 1030-1044.

10 Chaum, D. Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. In Advances in Cryptology - EUROCRYPT '88 (Berlin, 1988), C. G. Gunther, Ed., vol. 330 of Lecture Notes in Computer Science, Springer-Verlag, pp. 177-182.

11 Demillo, R., and Merritt, M. Protocols for data security. Computer (February 1983), 39-51.

12 Dyer, J. S., and Miles, Jr., R. E. An actual application of collective choice theory to the selection of trajectories for the Mariner Jupiter/Satern 1977 project. Operations Research 24 (March 1976), 220-44.

13 Engstron, R. L. Cincinnati's 1988 proportional representation initiative. Electoral Studies 9, 3 (September 1990), 217-225.

14 Felsenthal, D. S., and Maoz, Z. A comparative analysis of sincere and sophisticated voting under the plurality and approval procedures. Behavioral Science 33, 2 (1988), 116-130.

15 Fujioka, A., Okamoto, T., and Ohta, K. A practical secret voting scheme for large scale elections. In Advances in Cyptology - AUSCRYPT '92 (Berlin, 1993), J. Seberry and Y. Zheng, Eds., vol. 718 of Lecture Notes in Computer Science, Springer-Verlag, pp. 244-251.

16 Gallagher, M. The political consequences of the electoral system in the Republic of Ireland. Electoral Studies 5, 3 (1986), 253-275.

17 Gardenfors, P. Manipulation of social choice functions. Journal of Economic Theory 13 (1976), 217-228.

18 Gibbard, A. Manipulation of voting schemes: a general result. Econometrica 41, 4 (July 1973), 587-601.

19 Gibbons, R. Game Theory for Applied Economists. Princeton University Press, Princeton, 1992.

20 Hill, I., Wichmann, B., and Woodall, D. Single transferable vote by Meek's method. The Computer Journal 30, 3 (1987), 277-281.

21 Hoffman, D. T. A model for strategic voting. SIAM Journal of Applied Mathematics 42, 4 (August 1982), 751-761.

22 Koschnick, W. J. Bandwagons and underdogs. Society (September/October 1982), 12-14.

23 Merrill, III, S. Strategic decisions under one-stage multi-candidate voting systems. Public Choice 36 (1981), 115-134.

24 Merrill, III, S. A comparison of efficiency of multicandidate electoral systems. American Journal of Political Science 28 (1984), 23-48.

25 Merrill, III, S. Making Multicandidate Elections More Democratic. Princeton University Press, Princeton, 1988.

26 Myerson, R. B., and Weber, R. J. A theory of voting equilibria. American Political Science Review 87, 1 (March 1993), 102-114.

27 Nagel, J. A debut for approval voting. PS: Political Science 17 (Winter 1984), 62-65.

28 Nurmi, H., and Salomaa, A. A cryptographic approach to the secret ballot. Behavioral Science, 1 (1991), 34-40.

29 Nurmi, H., Salomaa, A., and Santean, L. Secret ballot elections in computer networks. Computers &Security 36, 10 (1991), 553-560.

30 Ordeshook, P. C. A Political Theory Primer. Routledge, New York, 1992.

31 Ordeshook, P. C., and Palfrey, T. R. Agendas, strategic voting, and signaling with incomplete information. American Journal of Political Science 32, 2 (1988), 441-466.

32 Phillips, K. Decisions, decisions. Corporate Computing (December 1992), 64.

33 Saari, D. G. Geometry of Voting, vol. 3 of Studies in Economic Theory. Springer-Verlag, New York, 1994.

34 Salomaa, A. Verifying and recasting secret ballots in computer networks. In New Results and New Trends in Computer Science (Berlin, 1991), H. Maurer, Ed., vol. 555 of Lecture Notes in Computer Science, Springer-Verlag, pp. 283-289.

35 Satterthwaite, M. A. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10 (1975), 187-217.

36 Schneier, B. Applied Cryptography. John Wiley &Sons, New York, 1994.

37 Wall, L., and Schwartz, R. L. Programming Perl. O'Reilly &Associates, 1991.

38 Weber, R. J. Comparison of voting systems, 1977. Cowles Foundation discussion paper No. 498A, cited in Merrill84.

39 Zimmerman, J. F. P.R. in Ireland: A firm tradition. National Civic Review (December 1983), 597-602.