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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call