The paper provides a complete characterization of Nash equilibria for games in which n candidates choose a strategy in the form of a platform, each from a circle of feasible platforms, with the aim of maximizing the stretch of the circle from where the candidate’s platform will receive support from the voters. Using this characterization, it is shown that if the sum of all players’ payoffs is 1, the Nash equilibrium payoff of each player in an arbitrary...
更多显示

详细

更多显示

订阅电子邮件通知

This document is being processed or is not available.