Abstract
This paper examines the property of the m votes to win mechanism. Voting is an effective way to make a collective decision but voting behaviors, e.g., monitoring the voting process, may incur a cost, that is, voting is often costly. In this case, compulsory voting incurs a larger cost. Random decision making can reduce the cost for voting but is skeptical in the quality of decision making. That is, we face the problem of how to balance the quality of collective decision making with the reduction of the cost for voting. To solve this problem, this paper focuses on the m votes to win mechanism, in which voters sequentially vote and if an alternative receives m votes, the voting process immediately terminates and the alternative received m votes wins. The similar voting mechanism is actually used in the Apache projects. However, the property of the m votes to win mechanism has not sufficiently studied. The questions include how to find a desirable value of m and what situation this mechanism is superior to other mechanisms. To answer these question, we create the discussion model where two alternatives is included, and analyze what voting strategy is rational. Based on the analysis, we examine what factors affects the social surplus, i.e., to what extent the quality of collective decision making and the reduction of the cost for voting are well balanced, and clarify whether the m votes to win mechanism is superior to the compulsory voting or the random decision making in terms of social surplus.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Airiau, S., Endriss, U.: Iterated Majority Voting. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS, vol. 5783, pp. 38–49. Springer, Heidelberg (2009)
Battaglini, M.: Sequential voting with abstention. Games and Economic Behavior 51(2), 445–463 (2005)
Börgers, T.: Costly voting. American Economic Review 94, 57–66 (2004)
Conitzer, V.: Making decisions based on the preferences of multiple agents. Communications of the ACM 53(3), 84–94 (2010)
Dekel, E., Piccione, M.: Sequential voting procedures in symmetric binary elections. Journal of Political Economy 108(1), 34–55 (2000)
Desmedt, Y., Elkind, E.: Equilibria of plurality voting with abstentions. In: Proceedings of the Eleventh ACM Conference on Electronic Commerce (EC 2010), pp. 347–356 (2010)
Elkind, E., Lang, J.: Guest editorial: special issue on computational social choice. In: Autonomous Agents and Multi-Agent Systems, vol. 22(1), pp. 1–3 (2011)
Farquharson, R.: Theory of Voting. Yale University Press (1969)
Meir, R., Polukarov, M., Rosenschein, J.S., Jennings, N.R.: Convergence to equilibria in plurality voting. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 823–828 (2010)
Morton, R.B., Williams, K.C.: Information asymmetries and simultaneous versus sequential voting. The American Political Science Review 93(1), 51–67 (1999)
Poundstone, W.: Gaming the Vote: Why Elections Aren’t Fair. Hill and Wang (2008)
Sloth, B.: The theory of voting and equilibria in noncooperative games. Games and Economic Behavior 5(1), 152–169 (1993)
Xia, L., Conitzer, V.: Stackelberg voting games: Computational aspects and paradoxes. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kagifuku, R., Matsubara, S. (2011). Costly Voting with Sequential Participation. In: Kinny, D., Hsu, J.Yj., Governatori, G., Ghose, A.K. (eds) Agents in Principle, Agents in Practice. PRIMA 2011. Lecture Notes in Computer Science(), vol 7047. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25044-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-25044-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25043-9
Online ISBN: 978-3-642-25044-6
eBook Packages: Computer ScienceComputer Science (R0)