Abstract
In spatial voting games without a core, if candidates are constrained on one issue, they are implicitly constrained on other issues. Thus external constraints affect optimal positions for candidates. Using new solution concepts, we find the optimal position for a candidate given any linear constraint, given an opponent’s constraint, and determine conditions when constraints are sufficient to yield unbeatable positions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
