Symmetric Spatial Games Without Majority Rule Equilibria

1976 ◽  
Vol 70 (4) ◽  
pp. 1172-1184 ◽  
Author(s):  
Richard D. McKelvey ◽  
Peter C. Ordeshook

The assumptions imposed in spatial models of election competition generally are restrictive in that they require either unidimensional issue spaces or symmetrically distributed electorate preferences. We attribute such assumptions to the reliance of these models on a single concept of a solution to the election game—pure strategy equilibria—and to the fact that such equilibria do not exist in general under less severe restrictions. This essay considers, then, the possibility that candidates adopt mixed minimax strategies. We show, for a general class of symmetric zero-sum two-person games, that the domain of these minimax strategies is restricted to a subset of the strategy space and that for spatial games this set not only exists, but if preferences are characterized by continuous densities, it is typically small. Thus, the hypothesis that candidates abide by mixed minimax strategies can limit considerably our expectation as to the policies candidates eventually advocate. Additionally, we examine the frequently blurred distinction between spatial conceptualizations of two-candidate elections and of committees, and we conclude that if pure strategy equilibria do not exist, this distinction is especially important since committees and elections can produce entirely different outcomes.

Games ◽  
2021 ◽  
Vol 12 (2) ◽  
pp. 47
Author(s):  
Sam Ganzfried

Successful algorithms have been developed for computing Nash equilibrium in a variety of finite game classes. However, solving continuous games—in which the pure strategy space is (potentially uncountably) infinite—is far more challenging. Nonetheless, many real-world domains have continuous action spaces, e.g., where actions refer to an amount of time, money, or other resource that is naturally modeled as being real-valued as opposed to integral. We present a new algorithm for approximating Nash equilibrium strategies in continuous games. In addition to two-player zero-sum games, our algorithm also applies to multiplayer games and games with imperfect information. We experiment with our algorithm on a continuous imperfect-information Blotto game, in which two players distribute resources over multiple battlefields. Blotto games have frequently been used to model national security scenarios and have also been applied to electoral competition and auction theory. Experiments show that our algorithm is able to quickly compute close approximations of Nash equilibrium strategies for this game.


2018 ◽  
Vol 7 (3.34) ◽  
pp. 667
Author(s):  
K Selvakumari ◽  
S Lavanya

The Soft set theory, originally proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainity.This paper is devoted to the discussions of Neutrosophic fuzzy soft set. A new game modelis proposed and called Neutrosophicfuzzy soft game since it is based on Neutrosophic fuzzy soft set theory. We concentrate on discussing a class of two person zero-sum games with Neutrosophic fuzzy soft payoffs.The proposed scheme is illustrated by an example regarding the pure strategy problem.  


2009 ◽  
Vol 40 (1) ◽  
pp. 11-30 ◽  
Author(s):  
Macartan Humphreys ◽  
Michael Laver

Long-standing results demonstrate that, if policy choices are defined in spaces with more than one dimension, majority-rule equilibrium fails to exist for a general class of smooth preference profiles. This article shows that if agents perceive political similarity and difference in ‘city block’ terms, then the dimension-by-dimension median can be a majority-rule equilibrium even in spaces with an arbitrarily large number of dimensions and it provides necessary and sufficient conditions for the existence of such an equilibrium. This is important because city block preferences accord more closely with empirical research on human perception than do many smooth preferences. It implies that, if empirical research findings on human perceptions of similarity and difference extend also to perceptions ofpoliticalsimilarity and difference, then the possibility of equilibrium under majority rule re-emerges.


Author(s):  
Ignacio Palacios-Huerta

This chapter is concerned with mixed strategies. Using fMRI techniques, it peers inside the brain when experimental subjects play the penalty kick game. As we have noted already, minimax is considered a cornerstone of interactive decision-making analysis. More importantly, the minimax strategies have not been mapped in the brain previously by studying simultaneously the two testable implications of equilibrium. The results show increased activity in various bilateral prefrontal regions during the decision period. Two inferior prefrontal nodes appear to jointly contribute to the ability to optimally play the study's asymmetric zero-sum penalty kick game by ensuring the appropriate equating of payoffs across strategies and the generating of random choices within the game, respectively. This evidence contributes to the neurophysiological literature studying competitive games.


1976 ◽  
Vol 70 (4) ◽  
pp. 1202-1214 ◽  
Author(s):  
Russell Hardin

The proof of Riker's size principle is inadequate for the general class of zero-sum bargaining games (whether symmetric or asymmetric), and the principle is valid only for a very restricted class of games—the supersymmetric games and their asymmetric counterparts. Butterworth's modification of the size principle (the maximum number of positive gainers principle) can be extended to cover games which are only approximately symmetric. Roll-call voting in the United States House of Representatives overwhelmingly violates the size principle; hence, the House does not generally play a supersymmetric zero-sum bargaining game. More generally, both Butterworth's and Riker's principles seem inapplicable to large bodies.


2010 ◽  
Vol 06 (01) ◽  
pp. 17-29 ◽  
Author(s):  
JOHN N. MORDESON ◽  
TERRY D. CLARK

Predictions concerning voting outcomes in crisp spatial models rely heavily on the existence of a core, in the absence of which political players choosing among a set of alternatives by majority rule will not be able to arrive at a stable choice. No matter which option they might initially choose, most voting rules will permit another option to defeat the previously chosen one. Such problems particularly plague majority rule spatial models at dimensionalities greater than one. In a series of recent papers, we have argued that fuzzy spatial models offer a partial solution to this problem. In this paper, we explore the existence of a fuzzy core. Our major conclusion is that a fuzzy core is more likely in two or more dimensions as the number of players increases.


Games ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 25
Author(s):  
Qingqing Cheng ◽  
Ming Li

Adopting the group turnout model of Herrera and Mattozzi, J. Eur. Econ. Assoc. 2010, 8, 838–871, we investigate direct democracy with supermajority rule and different preference intensities for two sides of a referendum: Reform versus status quo. Two parties spend money and effort to mobilize their voters. We characterize the set of pure strategy Nash equilibria. We investigate the optimal majority rule that maximizes voters’ welfare. Using an example, we show that the relationship between the optimal majority rule and the preference intensity is not monotonic—the optimal majority rule is initially decreasing and then increasing in the preference intensity of the status quo side. We also show that when the preference intensity of the status quo side is higher, the easiness to mobilize voters on the status quo side is lower, or the payoff that the reform party receives is higher, the optimal majority rule is more likely to be supermajority.


2021 ◽  
Vol 9 ◽  
Author(s):  
Zhen Wang ◽  
Mengting Jiang ◽  
Yu Yang ◽  
Lili Chen ◽  
Hong Ding

Most critical infrastructure networks often suffer malicious attacks, which may result in network failures. Therefore, how to design more robust defense measures to minimize the loss is a great challenge. In recent years, defense strategies for enhancing the robustness of the networks are developed based on the game theory. However, the aforementioned method cannot effectively solve the defending problem on large-scale networks with a full strategy space. In this study, we achieve the purpose of protecting the infrastructure networks by allocating limited resources to monitor the targets. Based on the existing two-person zero-sum game model and the Double Oracle framework, we propose the EMSL algorithm which is an approximation algorithm based on a greedy search to compute effective mixed strategies for protecting large-scale networks. The improvement of our approximation algorithm to other algorithms is discussed. Experimental results show that our approximation algorithm can efficiently compute the mixed strategies on actual large-scale networks with a full strategy space, and the mixed defense strategies bring the highest utility to a defender on different networks when dealing with different attacks.


Sign in / Sign up

Export Citation Format

Share Document