A Method Based on Congestion Game Theory for Determining Electoral Tendencies
We present a novel method to study the tendencies of vote in sectorial democratic elections. Our method is intended to determine the relevant profiles characterizing the political behavior of voters. Those profiles allow us to model how the voters, in a specific election organized by sectors, make their vote decision. Furthermore, the same set of profiles are used for representing the different strategies applied by the candidates that compete in the election.
We apply congestion games theory to simulate the distribution of the votes among the candidates, describing an automated way to estimate the likely number of votes for each candidate. Therefore, we can determine who will be the winner candidate of the election, according to a specific political scenario. We report the application of our model to simulate the elections of a director in a university setting, obtaining estimations very close to the actual outcomes.
KeywordsSocial Behavior Modeling Social Simulation Electoral Simulation Congestion Games Multi-Agent System
Unable to display preview. Download preview PDF.
- 2.De Ita, G., Moyao, Y., Contreras, M.: Modeling Democratic Elections via Congestion Networks. In: First Int. Conf. on Social Eco-Informatics, vol. 1, pp. 85–90 (2011)Google Scholar
- 6.Morales, P.: Evaluación de los valores: análisis de listas de ordenamiento, CTAN (2011), http://www.upcomillas.es/personal/peter/otrosdocumentos/ValoresMetodo.pdf
- 7.Morales, P.: Cuestionarios y Escalas, Universidad Pontificia Comillas, CTAN (2011), http://www.upcomillas.es/personal/peter/otrosdocumentos/CuestionariosyEscalas.doc
- 8.Pajares, F.M.: Teachers’ Beliefs and Educational Research: Cleaning up a Messy Construct. Review of Educational Research 16, 307–332 (1992)Google Scholar
- 12.Kim, S., Taber, Ch.S., Lodge, M.: A Computational Model of the Citizen as Motivated Reasoner: Modeling the Dynamics of the 2000 Presidential Election. Polit Behav. 32, 1–28 (2010)Google Scholar
- 13.Fabrikant, A., Papadimitriou, Ch.S., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Procs. STOC 2004, Chicago, Illinois, USA, June 13-15, pp. 604–612 (2004)Google Scholar