Article ID Journal Published Year Pages File Type
482233 European Journal of Operational Research 2006 9 Pages PDF
Abstract

We consider a problem of Political Economics with two opposed political parties. They will attempt to capture the greatest number of voters of a discrete population of elements. It is supposed that these parties can modify in their policies to a certain degree. Our purpose is to determine the optimum position or positions for the party in terms of guaranteeing the maximum number of voters. We will apply the techniques of Computational Geometry.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , , ,