Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/1961414.1961442guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Search algorithm to find optimum strategies to shape political action with subjective assessment

Published: 30 November 2010 Publication History

Abstract

This paper introduces a problem related to decision-making and the shaping of political strategies in the course of one term of office, in which the government and the opposition shape their proposals for action on two issues that are relevant for the citizens. A variable component is considered regarding both the relevance of the issues to be dealt with and the strategies that the parties are presumed to adopt. The aim of this study is to find the optimum strategies for the two majority parties of a country, while allowing them to vary their proposals to a certain degree. In addition, the process is dynamic because the proposals are intended to be modified taking into account the other party's foreseen action. The contribution of this article lies in this approach, as well as in its taking into account variable components. The problem is dealt with from a geometric point of view, and a search algorithm to find optimum strategies is developed.

References

[1]
Abellanas, M., Lillo, I., Lóez, M.D., Rodrigo, J. 2006. Electoral strategies in a dynamical democratic system: geometric models. European Journal of Operational Research 175, 870-878.
[2]
Abellanas, M., Lóez, M.D., Rodrigo, J. Searching for equilibrium positions in a game of political competition with restrictions. European Journal of Operational Research 201, Issue 3 (2010), pp. 892-896.
[3]
Ahn, H, Cheng, S, Cheong, O., Golin, M., Oostrum, R. 2001. Competitive Facility Location along a Highway. 7th Annual International Computing and Combinatory Conference 2108 of LNCS.
[4]
Benoit, K., Laver, M. 2006. Party Policy in Modern Democracies. London: Routledge.
[5]
Bentley, J.L., Ottmann, T.A. 1979. Algorithms for reporting and counting geometric intersections. IEEE Trans Comput. C-28, 643-647.
[6]
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O. 1997. Computational Geometry, Algorithms and Applications. Springer. New York.
[7]
Cheong, O., Har-Peled, S. Linial, N., Matousek, J. 2004. The One-Round Voronoi Game. Discrete & Computational Geometry 31 (1), 125-138.
[8]
Consolidated General Government Budget (1997-2006). Available online: http://www.igae.meh.es/Internet/Cln_Principal/ClnPresupuesto/Presup uestosGeneralesEst/PresupuestosGeneralesEstado/
[9]
Dehne, F., Klein, R., Seidel, R. 2002. Maximizing a Voronoi Region: The Convex Case. Lectures Notes in Computer Science. Proc ISAAC 2518; 624-634.
[10]
Edelsbrunner, H. Guibas, L., Pach, J., Pollack, R., Seidel, R. Sharir, M. 1992. Arrangements of curves in the plane-topology, combinatorics and algorithms. Theoretical computer science, 92, 319-336.
[11]
Fekete, S., Meijer, H. 2003. The One-Round Voronoi Game Replayed. Workshop on Algorithms and Data Structures, Springer Lecture Notes in Computer Science 2748, 150-161.
[12]
Hinich, M. J. 2007. A spatial theory approach to the study political spaces. In Topics in analytical political economy, Ed. by William Barnett and Melvin Hinich (especial issue), chapter 5.
[13]
Laver, M., Schilperoord, M. 2007. Spatial models of political competition with endogenous political parties. Philosophical Transactions Royal Society 29; 362(1485): 1711-1721.
[14]
Lillo, I., Lóez, M., Rodrigo, J. 2007. A Geometric study of the Nash equilibrium in a weighted case. Applied Mathematical Sciences 55 (1), 2715-2725.
[15]
Llavador, H. 2008. Voting with preference over margins of victory. Mathematical Social Science 56 (3), 355-365.
[16]
Okabe, A., Suzuki, A. 1997. Stability of Spatial Competition of Many Firms in a Bounded Two-Dimensional Space. Environment and Planning A 19, 1067-1082.
[17]
Okabe, A., Boots, B., Sugihara, K., Chiu, S. 2000. Spatial Tessellations Concepts and Applications of Voronoi diagrams. John Wiley & Sons. Chichester.
[18]
Persson, T., Tabellini, G. 1999. Political Economics and Public Finance. NBER Working Papers Series. Handbook of Public Economics, vol III.
[19]
Plastria, F. and Carrizosa, E. 2004. Optimal location and design of a competitive facility. Mathematical Programming 100, 247-265.
[20]
Roemer, J. 2001. Political Competition. Harvard University Press.
[21]
Sharir, M., Agarwal, P.K. 1995. Davenport-Schinzel sequences and their geometric applications. Cambridge University Press.
[22]
Teramoto, Demaine and Uehara. 2006. Voronoi game on graphs and its complexity. In Proceedings of the 2nd IEEE Symposium on Computational Intelligence and Games (CIG 2006), Reno, Nevada. 265-271.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
ECS'10/ECCTD'10/ECCOM'10/ECCS'10: Proceedings of the European conference of systems, and European conference of circuits technology and devices, and European conference of communications, and European conference on Computer science
November 2010
353 pages
ISBN:9789604742509

Publisher

World Scientific and Engineering Academy and Society (WSEAS)

Stevens Point, Wisconsin, United States

Publication History

Published: 30 November 2010

Author Tags

  1. computational geometry
  2. operations research
  3. search algorithms

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Feb 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media