1 Introduction

In democratic societies, collective decisions are made in legislatures. Legislators are often grouped into parties. Party representation and configuration in turn depend on the political framework (cf. Rae 1971; Lijphart 1990; Taagepera and Shugart 1989) and the particular strategies adopted by politicians, parties and voters within that framework. Duverger’s Law states that plurality voting in single member districts tends to favor a two-party system (Duverger 1954; Riker 1982). Theoretical support for this law has been provided in Cox (1987), Palfrey (1989), Feddersen (1992) and Fey (1997) by assuming strategic voters who avoid wasting their vote on “hopeless” candidates and in Rivière (1998) and Osborne and Tourky (2008) by assuming economies of party size. Fey (2007) finds support for the law in a setting with sincere voters and pure policy-motivated candidates when the available policies are the corner points of the unit square.Footnote 1 In this paper, we aim to contribute to the game-theoretic foundation of Duverger’s Law.

The theoretical literature on political party formation and configuration typically builds on the Downsian model of electoral competition, which assumes voters to be distributed along a line segment representing the agenda space (Downs 1957a). We believe that the linear model of electoral competition is not suitable for this research as the incentives to attract the median voter easily generate a single party in the pluralistic system under sincere voting when we consider equilibrium refinements that allow movements at the party level (see Sect. 5). This motivates our point of departure from the standard framework: We instead assume that the set of agendas equals the unit circle. We hereby follow in the success of the industrial organization literature in studying multi-firm competition by moving from Hotelling’s linear city (Hotelling 1929) to Salop’s circular city (Salop 1979).Footnote 2

Before continuing, we believe some justification for using the circle as the agenda space is needed and we provide two views we believe are better captured by the circle than by the line.Footnote 3

First, in political science, the horseshoe theory stipulates that parties usually depicted as far-left and far-right are more similar to each other in essentials than either are to the political center, and hence the political spectrum is better represented by a horseshoe than with a linear bar.Footnote 4 For instance, both extremes typically disapprove of immigration: Labor unions because aliens take their jobs and strong nationalists view aliens as a threat to the native culture. They also share a similar distaste for foreign aid: Extreme left because foreign aid usually ends up in the hands of corrupt elites and bolsters pro-market policies and extreme right because it bolsters inefficient public sector. A prime example for a country where the left and right extreme parties can be considered to be competing for the same voters is the Netherlands. Parties that are usually considered extreme right (PVV) and left (SP) both have a nationalistic focus concerning geopolitical issues and plea for increasing investments in public health and security, lowering bureaucracy and taxes for households, small-scale education and cutting budgets for defense and the royal family. According to the Dutch political barometer of 22 October 2015 by Ipsos, 19.3 % of the voters that voted for the SP in the latest elections indicated that they intend to vote for the PVV in the next elections.Footnote 5

Second, even when extreme ideological positions do not coincide, the literature on political psychology tells us that right and left wing extremists (including radicals, reactionists, fundamentalists and fanatics) have similarities in their cognitive styles, the ways of engaging with political opposition, and the means of achieving their goals (cf. McClosky and Chong 1985; Brandt et al. 2015).

The summary description of our model is as follows. There are a finite number of politicians that simultaneously and independently choose to promote agendas in the elections, where the set of agendas is the unit circle. Politicians promoting the same agenda form a party. Hence, the party structure follows directly from the politicians’ decisions to promote agendas. We assume that the voters are uniformly distributed over the unit circle, with each voter’s most preferred agenda coinciding with her location on the circle. We consider both the situation where voters are assumed to vote sincerely (i.e., support the party closest to their most preferred agendas) and to vote strategically. Next, the pluralitarian electoral system assigns all power to the parties with the highest vote share (winner takes all). We assume that the politicians belonging to a party share equally in its power, and each politician is opportunistic (office-motivated), trying to maximize her individual power. Hence, in general, each politician prefers to become a member of a party with a high vote share but as few other members as possible.

We provide a full characterization of the sets of pure-strategy (subgame-perfect) Nash equilibria in both the case of sincere and strategic voting, and show that these sets are nonempty. Typically, both situations possess a rich set of equilibria.Footnote 6 Therefore, we define notions of defection-proofness to refine the Nash predictions. This refinement is similar in motivation to coalition-proof Nash equilibrium (Bernheim et al. 1987) but only allows for particular deviations, which we call defections.Footnote 7 The defections include deviations by a coalition of politicians that are typically observed in reality; for instance, shifts in agenda, mergers of parties, and a set of politicians splitting from their original parties and forming a new party or joining an existing one.Footnote 8 For the situation with strategic voters, we also consider defections by voters, which involves a coalition of voters agreeing to vote for a specific party.

We show that, in the situation with sincere voting, Nash equilibria that generate strictly more than three parties are not defection-proof. Intuitively, sincere voting creates incentives for parties supporting adjacent agendas to come to a compromise by supporting an agenda that lies in the middle of their original positions. Although such a compromise creates a larger party, this party garners a plurality of the votes whenever there are at least four parties before this coalitional defection. Moreover, this compromise is credible as it ensures that no defecting subcoalition can gain a plurality. We also show that defection-proofness rules out equilibria with exactly one party when voters are sincere. A single party equilibrium is easily undermined by a defection by a single politician since the defecting politician garners exactly half the votes (contrast this with the result on a line where the single party located at the median cannot be undermined by any defection). Thus, our defection-proof Nash equilibrium predictions under sincere voting are only partially consistent with Duverger’s Law: We predict either two or three parties to be effective under sincere voting.

In the situation with strategic voting, any configuration of political parties can be supported as a subgame-perfect Nash equilibrium since voters are atomless. When refining these predictions using our notion of defection-proofness that allows any mass of voters to defect, we find that configurations with three or more parties do not survive. Whenever three or more parties are equally likely to gain power, there exists a coalition of voters located around the midpoint between any two parties who would switch their votes to their second most preferred party—which causes that party to win—rather than vote sincerely as these voters prefer that their second most preferred party gains power for sure over a lottery in which parties that are even worse are likely to gain power. We also show that defection-proof equilibria with one or two parties exist when we restrict the defections by voters to groups of less than half of the total electorate. Hence, our defection-proof predictions under strategic voting too are only partially consistent with Duverger’s Law: We predict either one or two parties to be effective under strategic voting.

The rest of the paper is organized as follows. We present the model and definitions in Sect. 2. Sections 3 and 4 present the results for sincere and strategic voting, respectively. We compare our results to those of the linear agenda space in Sect. 5. Section 6 summarizes our results. Proofs for sincere and strategic voting are collected in Appendices 7 and 8, respectively.

2 Model and definitions

There is a finite set of politicians I with \(|I|\ge 3\).Footnote 9 The set of agendas A is the circumference of a circle of unit length. An agenda is denoted by a. Voters are uniformly distributed on A.Footnote 10 We identity each voter by her location on A.

There are two stages in our model:

Stage I::

The I politicians simultaneously choose to support agendas on the circle. We restrict attention to pure strategies. Therefore, A is the set of strategies for each politician. The politicians’ strategy profile is denoted by s. For any \(J\subseteq I\), \(s_J\) denotes the strategy profile \((s_i)_{i\in J}\) and \(s_{-J}\) denotes the strategy profile \((s_i)_{i\in I{\setminus } J}\).

The politicians’ strategy profile s defines a partition \({\mathcal {P}}(s)\) of the set of politicians, where each \(P\in {\mathcal {P}}(s)\) is such that for some agenda a, \(s_i=a\) for all \(i\in P\) and \(s_j\ne a\) for all \(j\not \in P\). That is, every politician who belongs to P supports the same agenda a in the profile s and none of the politicians outside P support the agenda a. We will refer to any \(P\in {\mathcal {P}}(s)\) as a party. Hence, \({\mathcal {P}}(s)\) is the set of all parties formed under the politicians’ strategy profile s. The agenda supported by a party \(P\in {\mathcal {P}}(s)\) is the unique agenda supported by every politician who belongs to P.

Stage II::

Let s be the politicians’ strategy profile in Stage I and \({\mathcal {P}}(s)\) be the resulting set of political parties formed under s. In Stage II, each voter casts her vote for one of the parties in \({\mathcal {P}}(s)\). We assume that all voters play pure strategies. Hence, the voters’ strategy profile is a mapping \(v_s:A\rightarrow {\mathcal {P}}(s)\) such that the voter located at agenda a votes for the political party \(v_s(a)\). We restrict attention to strategy profiles \(v_s\) that are Lebesgue measurable.

Given s in Stage I and \(v_s\) in Stage II, the weight \(w_P(s,v_s)\) of a party \(P\in {\mathcal {P}}(s)\) is the measure of voters who vote for party P under the voters’ strategy profile \(v_s\). Note that \(w_P(s,v_s)\ge 0\) for all \(P\in {\mathcal {P}}(s)\) and \(\sum _{P\in {\mathcal {P}}(s)}w_P(s,v_s)=1\). Thus, \(w(s,v_s)=\big (w_P(s,v_s)\big )_{P\in {\mathcal {P}}(s)}\) is the resulting distribution of weights over parties in \({\mathcal {P}}(s)\).

A voting rule \(\rho \) defines for each strategy profile \((s,v_s)\) the power \(\rho _P(w(s,v_s))\) of each party \(P\in {\mathcal {P}}(s)\) as a function of the distribution of weights \(w(s,v_s)\). In this paper, we restrict attention to the plurality rule Footnote 11 so that all parties with the maximum weight share power equally whereas any party with less than the maximum weight gets zero power. Formally, for any \((s,v_s)\), the plurality rule defines the power of any \(P\in {\mathcal {P}}(s)\) as

$$\begin{aligned} \rho _P(w(s,v_s)) \equiv {\left\{ \begin{array}{ll} \frac{1}{|\arg \max _{P^{\prime } \in \mathcal {P}(s)}w_{P^{\prime }}(s,v_s)|},&{} \text {if }P\in {\arg \max }_{P^{\prime }\in \mathcal {P}(s)}w_{P^{\prime }}(s,v_s) \\ 0, &{} \text {otherwise.} \end{array}\right. } \end{aligned}$$

For any strategy profile \((s,v_s)\), we say that a party \(P\in {\mathcal {P}}(s)\) is effective under \(v_s\) if it has positive power, i.e., \(\rho _P(w(s,v_s))>0\).

We assume that the politicians belonging to a party share equally in its power. Furthermore, politicians receive utility equal to their individual power – such office-motivated politicians are standard in the literature (cf. Downs 1957b). Hence, the utility of politician i under the strategy profile \((s,v_s)\) is \(u_i(s,v_s)=\frac{\rho _{P}(w(s,v_s))}{|P|}\), where \(i\in P\in \mathcal {P}(s)\).Footnote 12

Let \(u(a';a)\) denote the utility of the voter located at a when there is a single effective party that supports agenda \(a'\). We assume that u is a continuous function in both arguments and \(u(a';a)<u(a'';a)\) if and only if \(a'\) is located at a greater distance from a than \(a''\).Footnote 13 Thus, each voter’s location on A is her most-preferred agenda and her utility decreases continuously in the distance between her most-preferred agenda and the agenda supported by the single effective party. If two or more parties are effective, then we assume that the voters consider each agenda supported by these effective parties as equally likely and evaluate the resulting lottery over agendas by its expected utility.

In subsequent sections, we will analyze “defection-proof” equilibria both under sincere and strategic voting. Although the notion of equilibrium (Nash or subgame-perfect Nash) differs based on the voters’ behavior (therefore, we leave these definitions until the relevant sections), we can give general definitions for defections and credible defections that can be applied to both sincere and strategic voting models. Our definition of defection allows for the possibility of coordinated deviation by a coalition of players (either politicians or voters but not both).

To define defection and credible defection by politicians, suppose the voters’ behavior in Stage II is given by \((v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\), i.e., voters vote according to the strategy profile \(v_{{\tilde{s}}}\) in Stage II following each \({\tilde{s}}\in A^{|I|}\) in Stage I.

Definition 1

(Defection by politicians) Given \((v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\), a defection from the politicians’ strategy profile s by a coalition \(J\subseteq I\) is a strategy profile for coalition J, \(s^{\prime }_J\in A^{|J|}\), such that \(s_j\ne s^{\prime }_j=a\) for all \(j\in J\), and \(u_j\left( (s^{\prime }_J,s_{-J}),v_{(s^{\prime }_J,s_{-J})}\right) > u_j\left( (s_J,s_{-J}),v_{(s_J,s_{-J})}\right) \) for all \(j\in J\).Footnote 14

Thus, a defection by politicians is a deviation from the politicians’ strategy profile by a coalition of politicians that satisfies two requirements: First, all the members of the coalition deviate to the same agenda, and second, all the members of the coalition must strictly improve their utilities after the deviation. The following are some examples of defections by politicians:

  • Shift in a party’s agenda: All the politicians in a party decide to shift the agenda supported by their party.

  • Split in a party: A subset of politicians belonging to a party form a new party by supporting a different agenda.

  • Merger of parties: All the politicians in two or more parties choose to support a new common agenda.

  • A set of politicians split from their original parties and merge at a new or some previously supported agenda.

Such defections by politicians are quite common in politics, and therefore we allow for them in our model. However, unless binding agreements are possible among the defecting coalition, the defection must be self-enforcing or credible.

Definition 2

(Credible defection by politicians) Given Stage II strategies \((v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\):

(i) :

A credible defection from the politicians’ strategy profile s by a politician \(j\in I\) is a \(s^{\prime }_j\in A\) such that \(s^{\prime }_j\) is a defection from s by politician j.

(ii) :

A credible defection from the politicians’ strategy profile s by a coalition \(J\subseteq I\) such that \(|J|>1\) is a strategy profile for coalition J, \(s^{\prime }_J\in A^{|J|}\), such that \(s^{\prime }_J\) is a defection from s by coalition J and there does not exist any subcoalition \(J^{\prime }\subset J\) with a credible defection from \((s^{\prime }_J,s_{-J})\).

Thus, a credible defection by a coalition of politicians is such that no further credible defection is possible by any proper subcoalition of politicians.Footnote 15 We similarly define defection and credible defection by voters.

Definition 3

(Defection by voters) Consider Stage II following the politicians’ strategy profile s.

(i) :

Let \(B\subseteq A\) be a subset of voters with a positive measure. A defection from \(v_s\) by B is a voters’ strategy profile \(v'_s\) such that \(v_s(a)=v'_s(a)\) for all \(a\notin B\), \(v_s(a)\ne v'_s(a)=P\in {\mathcal {P}}(s)\) for all \(a\in B\), and every voter in B gets greater utility under \(v'_s\) than under \(v_s\).

(ii) :

Pick any \(\delta \) such that \(0<\delta \le 1\). A \(\delta \)-defection from \(v_s\) is a defection from \(v_s\) by a subset of voters B that has at most \(\delta \) measure.

Thus, a defection by voters is a deviation from the voters’ strategy profile by a coalition of voters that has a positive measureFootnote 16 which satisfies two requirements: First, all the members of the coalition deviate to vote for the same party, and second, all the members of the coalition must strictly improve their utilities after the deviation. The notion of \(\delta \)-defection by voters restricts attention to those defections by voters in which the size of the defecting coalition of voters is bounded by \(\delta \).

Definition 4

(Credible defection by voters) Consider Stage II following the politicians’ strategy profile s.

(i) :

Let \(B\subseteq A\) be a subset of voters with a positive measure. A credible defection from \(v_s\) by B is a voters’ strategy profile \(v'_{s}\) such that \(v'_s\) is a defection from \(v_s\) by B and there does not exist a subset of voters \(C\subset B\) such that C has a positive but smaller measure than B and there is a credible defection from \(v'_s\) by C.Footnote 17

(ii) :

A credible \(\delta \)-defection from \(v_s\) is a credible defection from \(v_s\) by a subset of voters B that has at most \(\delta \) measure.

Thus, a credible defection by a coalition of voters is such that no further credible defection is possible by any proper subcoalition of voters. The notion of credible \(\delta \)-defection by voters restricts attention to those credible defections by voters in which the size of the defecting coalition of voters is bounded by \(\delta \).

3 Sincere voting

In this section, we assume that each voter votes sincerely in Stage II for the party supporting the agenda nearest to her most-preferred agenda; in case there are two such parties, the indifferent voter votes for one of them using some tie-breaking rule.Footnote 18 Let s be the politicians’ strategy profile in Stage I. We denote the voters’ sincere strategy profile by \(v^*_s\). For any \(P\in {\mathcal {P}}(s)\), let \(R^s(P)\) be the first party that is supporting an agenda in the clockwise direction starting at the agenda supported by P. Similarly, let \(L^s(P)\) be the first party that is supporting an agenda in the counterclockwise direction starting at the agenda supported by P. Any two parties \(P,P^{\prime }\in {\mathcal {P}}(s)\) are adjacent if \(P^{\prime }\in \{L^s(P),R^s(P)\}\). We term the length of the arc between the agenda supported by P and agenda supported by \(L^s(P)\) as the left distance of party P and denote it by \(l^s(P)\). Similarly, the length of the arc between the agenda supported by P and agenda supported by \(R^s(P)\) will be called the right distance of party P and denoted by \(r^s(P)\). The distance between two parties is the minimum of the two.

As voters are assumed to vote sincerely, the weight of a party \(P\in {\mathcal {P}}(s)\) is equal to half of the sum of its left and right distances: \(w_P(s,v^*_s)=\frac{l^s(P)+r^s(P)}{2}\) (see Fig. 1).

Fig. 1
figure 1

The dotted lines demarcate arcs that define the distance between adjacent parties. The thick lines demarcate arcs that define each party’s voter base or weight under sincere voting. The weight of a party under sincere voting is the average of its left and right distances

3.1 Nash equilibrium

Since the voters vote sincerely in Stage II, we have to only analyze the strategic interaction among the politicians in Stage I. To this end, we first study the Nash equilibria of the Stage I game amongst the politicians under the assumption of sincere voting in Stage II.

Definition 5

(Nash equilibrium under sincere voting) The politicians’ strategy profile s is a Nash equilibrium under sincere voting if there do not exist \(i\in I\) and \(s^{\prime }_i\in A\) such that \(u_i\left( (s^{\prime }_i,s_{-i}),v^*_{(s^\prime _i,s_{-i})}\right) > u_i\left( (s_i,s_{-i}),v^*_{(s_i,s_{-i})}\right) \).

Thus, a Nash equilibrium under sincere voting is stable against unilateral deviations by a single politician.

The next theorem characterizes the set of Nash equilibria under sincere voting:

Theorem 1

The politicians strategy profile s is a Nash equilibrium under sincere voting if and only if the numbers of politicians in any two parties in \({\mathcal {P}}(s)\) differ by at most 1, and exactly one of the following holds:

  1. (i)

    \(|\mathcal {P}(s)|=2\) and the distance between the parties is more than \(\frac{1}{3}\).

  2. (ii)

    \(3\le |\mathcal {P}(s)| \le \frac{|I|}{2}\) and all parties have equal weight.

  3. (iii)

    \(3 \le |\mathcal {P}(s)|\le 4\), \(|\mathcal {P}(s)| > \frac{|I|}{2}\) and all parties are equidistant from each other.

  4. (iv)

    \(5\le |\mathcal {P}(s)| \le 6\), \(|\mathcal {P}(s)| > \frac{|I|}{2}\), all parties are equidistant from each other, and there does not exist any pair of singleton parties that are adjacent.

Thus, whether s is a Nash equilibrium under sincere voting or not depends only on two factors: First, the respective distances between the agendas supported in s—which determine the weights of the parties—and second, the numbers of politicians in the parties formed in s. Hence, if s is a Nash equilibrium under sincere voting, then the strategy profile \(s'\) obtained by either shifting the agendas supported by all politicians by a fixed constant or permuting the identities of the politicians will also be a Nash equilibrium under sincere voting. This is obviously because of the particular specification of the utilities of the politicians.

An important property of the Nash equilibrium under sincere voting is that all parties formed in equilibrium have equal weight (Lemma 7). This is because only those parties with the maximum weight obtain positive power. Hence, if a party has less than the maximum weight, then a politician belonging to that party obtains zero utility but could obtain positive utility by deviating to an agenda supported by some party (more precisely, any party with the highest weight in the hypothetical situation in which the set of politicians is \(I{\setminus }\{i\}\), where i is the deviating politician, and these politicians choose agendas according to the strategy profile \(s_{-i}\)).

As the weight of a party is the average of its left and right distances, the above mentioned property (Lemma 7) implies that the sums of the left and right distances of all parties formed in equilibrium are equal. Since the right (left) distance of party \(P^k\) is trivially equal to the left (right) distance of \(R^s(P^k)\) (\(L^s(P^k)\)), it follows that the left (right) distance of a party \(P^k\) equals the right (left) distance of party \(R^s(P^k)\) (\(L^s(P^k)\)). Therefore, if \(\{P^1,\ldots , P^n\}\) is the set of parties that form in Nash equilibrium under sincere voting and, without loss of generality, \(P^{k+1}=R^s(P^k)\) for all \(k=1,\ldots ,n-1\), then we obtain the following two sequences of equalities:

$$\begin{aligned} l^s(P^1)=r^s(P^2)=l^s(P^3)=r^s(P^4)=\cdots \nonumber \\ l^s(P^n)=r^s(P^1)=l^s(P^2)=r^s(P^3)=\cdots \end{aligned}$$
(1)

In words, if we move along the circle in the clockwise direction, then every other arc defined by the set of agendas supported in equilibrium has the same length.

Fig. 2
figure 2

Odd number (\(> 1\)) of parties under sincere voting: (1) All parties have equal weight and are equidistant. (2) The locations of the parties are the vertices of a convex regular polygon

The property that all parties have equal weight in equilibrium generates two possible configurations of parties in equilibrium:

  1. (i)

    An odd number of parties form in equilibrium. Then all parties must be equidistant from each other. To see this, suppose \(n=5\), i.e., five parties \(P^1,\ldots , P^5\) form in equilibrium (see Fig. 2(1)). Using (1), we obtain

    $$\begin{aligned} l^s(P^1)\!= & {} \!r^s(P^2)\!=\!l^s(P^3)\!=\!r^s(P^4)\!=\!l^s(P^5) \!=\!r^s(P^1)\!=\!l^s(P^2) \\= & {} \!r^s(P^3)\!=\!l^s(P^4)\!=\!r^s(P^5). \end{aligned}$$

    Since the parties are equidistant, the set of agendas supported in equilibrium s can be graphically visualized as the vertices of a n-sided convex regular polygon (as shown in Fig. 2(2)).

  2. (ii)

    An even number of parties form in equilibrium. First, consider the case when more than two parties form. Then both equidistant and non-equidistant configurations are possible. Figure 3 shows these configurations with six parties. In general, we can graphically visualize the set of agendas supported in equilibrium as follows. Since all parties have equal weight, we have

    $$\begin{aligned} l^s(P^2)+r^s(P^2)=l^s(P^4)+r^s(P^4)=l^s(P^6)+r^s(P^6)=\cdots \end{aligned}$$

    But \(l^s(P^2)+r^s(P^2)\) is the distance between the agendas supported by parties \(P^{1}\) and \(P^{3}\); \(l^s(P^{4})+r^s(P^{4})\) is the distance between the agendas supported by parties \(P^{3}\) and \(P^{5}\) and so on. Hence, all odd-numbered parties \((P^1,P^3,\ldots ,P^{n-3},P^{n-1})\) are equidistant from each other, and thus the agendas supported by these parties are vertices of an \(\frac{n}{2}\)-sided convex regular polygon (as shown in Fig. 4(2)). Similarly, all even-numbered parties \((P^2,P^4,\ldots ,P^{n-2},P^n)\) are equidistant from each other and the agendas supported by these parties are also vertices of an \(\frac{n}{2}\)-sided convex regular polygon (as shown in Fig. 4(2)). If in addition, all parties are equidistant from each other, then the agendas supported by all parties are vertices of a n-sided convex regular polygon (as shown in Fig. 4(1)).

    When only two parties form in equilibrium, each party has a weight of \(\frac{1}{2}\). In this case, it must be that the distance between the two parties is greater than \(\frac{1}{3}\). Otherwise, a single politician from the party having the larger number of politicians—who obtains a utility of at most \(\frac{1}{4}\) as she shares power of \(\frac{1}{2}\) with at least one other politician—can deviate to the agenda in the middle of the longer arc between the agendas supported by the two parties. The left and right distances of this new singleton party will be both at least \(\frac{1}{3}\), and hence it will have at least as much weight as the other two parties. Thus, the deviating politician will obtain a utility of at least \(\frac{1}{3}\), which is a contradiction.

The utility of a politician is a function both of the weight of her party and the number of other politicians who belong to her party. Since all parties have the same weight in equilibrium, a politician in party P obtains \(\frac{1}{|P|}\) proportion of the weight. If there is another party \(P^{\prime }\) such that \(|P|>|P^{\prime }|+1\), then a politician from party P could deviate to the agenda supported by \(P^{\prime }\), increasing her utility to \(\frac{1}{|P^{\prime }|+1}\) proportion of the weight. Therefore, the numbers of politicians in any two parties in \({\mathcal {P}}(s)\) differ by at most 1 in equilibrium.

Fig. 3
figure 3

Even number (\(>2\)) of parties under sincere voting: All parties have equal weight but both equidistant (shown in (1)) and non-equidistant (shown in (2)) configurations are possible. In (2), all even-numbered parties are equidistant from each other and all odd-numbered parties are equidistant from each other

Fig. 4
figure 4

Even number (\(>2\)) of parties under sincere voting: (1) When all parties are equidistant, their locations are the vertices of a convex regular polygon. (2) When parties are not equidistant, the locations of all even-numbered/odd-numbered parties are the vertices of a convex regular polygon

It also follows from Theorem 1 that the number of parties formed in Nash equilibrium under sincere voting is bounded below by 2 and above by \(\max \{\frac{|I|}{2},6\}\). Any strategy profile in which only a single party is formed is not an equilibrium since by deviating to any other agenda, any politician can form a singleton party with the weight of \(\frac{1}{2}\), and hence increase her utility from at most \(\frac{1}{3}\)—since \(|I|\ge 3\)—to \(\frac{1}{2}\). On the other hand, suppose the number of parties formed in equilibrium is greater than both \(\frac{|I|}{2}\) and 6. Figure 5(1) shows such a strategy profile of the politicians when \(|I|=17\) but nine parties form. Then at least one party, say \(P^2\), is singleton and the utility of this politician is less than \(\frac{1}{6}\) (see the figure). Since the numbers of politicians in any two parties cannot differ by more than 1, both \(P^1=L^s(P^2)\) and \(P^3=R^s(P^2)\) have at most two members. Without loss of generality, let \(r^s(P^2)\le l^s(P^2)\). If the single politician in \(P^2\) were to deviate to the agenda supported by \(P^3\) (as shown in Fig. 5(2)), then the weight of party \(P^3\cup P^2\) will increase by \(\frac{l^s(P^2)}{2}\) and the weight of \(P^1\) by \(\frac{r^s(P^2)}{2}\), while the weights of all other parties will stay constant as the agendas supported by their respective adjacent parties stay fixed. Since we started with a situation of equal weights, the merged party \(P^3\cup P^2\) will have the maximum weight, and hence, through this deviation, the politician will obtain a utility of at least \(\frac{1}{6}\) as she shares the power of at least \(\frac{1}{2}\) with at most two other members, which is a contradiction.

Fig. 5
figure 5

Under sincere voting, the number of parties is bounded above by \(\max \{\frac{|I|}{2},6\}\): Assume \(|I|=17\). (1) A strategy profile in which 9 parties form. (2) A unilateral deviation by the politician in \(P^2\) that increases her utility

The following corollary immediately follows from Theorem 1.

Corollary 2

For any \(|I|\ge 3\), the set of Nash equilibria under sincere voting is nonempty.

Indeed, the model has multiple Nash equilibria under sincere voting with the number of political parties in equilibrium ranging from 2 to \(\max \{\frac{|I|}{2},6\}\). Next, we refine our predictions using defection-proofness.

3.2 Defection-proof Nash equilibrium

A Nash equilibrium under sincere voting will not be stable if there exists a credible defection from it by coalitions of politicians. We therefore now restrict attention to defection-proof Nash equilibria.

Definition 6

(Defection-proof Nash equilibrium under sincere voting) The politicians’ strategy profile s is a defection-proof Nash equilibrium under sincere voting if given the sincere voting strategies in Stage II \((v^*_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\), there is no credible defection from s by any coalition \(J\subseteq I\).

Defection-proof Nash equilibria under sincere voting are stable against credible defections by any coalition of politicians. Clearly, the set of defection-proof Nash equilibria under sincere voting is a subset of the set of Nash equilibria under sincere voting.

The following theorem characterizes the set of defection-proof Nash equilibria under sincere voting.

Theorem 3

The politicians’ strategy profile s is a defection-proof Nash equilibrium under sincere voting if and only if the numbers of politicians in any two parties in \({\mathcal {P}}(s)\) differ by at most 1 and exactly one of the following holds:

  1. (i)

    \(|\mathcal {P}(s)|=2\) and the distance between the parties is more than \(\frac{1}{3}\).

  2. (ii)

    \(|\mathcal {P}(s)|=3\) and all parties are equidistant from each other.

Thus, defection-proofness sharply refines the set of Nash equilibria under sincere voting: Only those Nash equilibria in which either two or three parties form are defection-proof. To see why Nash equilibria with at least four parties are not defection-proof, let’s consider a Nash equilibrium s in which \(P^1,\ldots , P^n\) parties form, where \(n\ge 4\), and all parties are equidistant, with the distance equal to d (the proof takes care of all cases). Let a be the agenda that is the midpoint of the agendas supported by \(P^2\) and \(P^3\) (as shown in Fig. 6(1)). Now, if a coalition consisting of all politicians in \(P^2\) and \(P^3\) were to deviate to supporting a, ceteris paribus, then \(n-1\) parties, viz. \(\{P^1,P^2\cup P^3, P^4,\ldots ,P^n\}\), will be formed in the resulting profile \(s^{\prime }\) (as shown in Fig. 6(2)). The weight of the party \(P^2\cup P^3\) will be \(\frac{3}{2}d\), while the weights of \(P^1\) and \(P^4\) will each be \(\frac{5}{4}d\), and the weights of all other parties will remain unchanged. Since we started with a situation of equal weights, the merged party \(P^2\cup P^3\) will be the unique party with the maximum weight, and hence each member of the deviating coalition will obtain a utility of \(\frac{1}{|P^2|+|P^3|}\) compared to the utility of either \(\frac{1}{n|P^2|}\) or \(\frac{1}{n|P^3|}\) in profile s. Since \(n\ge 4\) and the numbers of politicians in parties \(P^2\) and \(P^3\) do not differ from each other by more than 1 – since s is a Nash equilibrium –, we have \(n|P^2|\ge 4|P^2|>2|P^2|+1\ge |P^2|+|P^3|\), and similarly, \(n|P^3|>|P^2|+|P^3|\). Thus, each member of the deviating coalition will be strictly better-off after the deviation, and hence we have obtained a defection from s by coalition \(P^2\cup P^3\). This defection is in fact credible. Consider any subcoalition \(J^{\prime }\subset P^2\cup P^3\). If starting from \(s^{\prime }\), all members of \(J^{\prime }\) were to deviate to an agenda like \(a^{\prime }\), which lies on the arc between the agendas supported by \(P^1\) and \(P^4\) that does not contain a (see Fig. 6(2)), then at least as many agendas as in \(s^{\prime }\) will be supported in the resulting profile \(s^{\prime \prime }\). However, the weight of party \(P^2\cup P^3{\setminus } J^{\prime }\) will not change while the weight of any other party will be at most \(\frac{5}{4}d\). Hence, the subcoalition \(J^{\prime }\) cannot improve its utility by this deviation. On the other hand, if starting from \(s^{\prime }\), all members of \(J^{\prime }\) were to deviate to an agenda like \(a^{\prime \prime }\) or \(a^{\prime \prime \prime }\), which lie between a and the agenda supported by either \(P^1\) or \(P^4\) (see Fig. 6(2)), then the weight of party \(J^{\prime }\) will be \(\frac{3}{4}d\), which is less than the weight of \(P^2\cup P^3{\setminus } J^{\prime }\). Thus, \(J^{\prime }\) cannot improve its utility by such a deviation. Hence, we conclude that the initial defection from s is a credible defection.

Fig. 6
figure 6

Under sincere voting, Nash equilibria with more than 3 parties are not defection-proof: (1) A Nash equilibrium with 5 parties. (2) A credible defection by \(P^2\cup P^3\)

Fig. 7
figure 7

Under sincere voting, Nash equilibria with 3 parties are defection-proof: (1) A Nash equilibrium with 3 parties. (2) There do not exist defections by politicians that result in only two supported agendas. (3) and (4) show that there do not exist defections by politicians that result in three supported agendas

In contrast, all Nash equilibria under sincere voting in which either two or three parties form are defection-proof. Let’s consider a Nash equilibrium s as shown in Fig. 7(1) with three parties, \(P^1\), \(P^2\) and \(P^3\) (the argument for two parties is similar). First, consider a defection in which all three parties merge, resulting in \(s^{\prime }\) with a single agenda being supported. Since \(s^{\prime }\) is not a Nash equilibrium under sincere voting, there exists a credible defection from \(s^{\prime }\) by a single politician belonging to the initial defecting coalition. Thus, the initial defection cannot be credible. Second, consider a defection in which all politicians except some in say \(P^3\) merge resulting in \(s^{\prime }\) in which two agendas are supported (as shown in Fig. 7(2)). Thus, instead of \(\frac{1}{3|P^1|}\), a defecting politician belonging to \(P^1\) obtains a utility of at most \(\frac{1}{2|P^1|+2|P^2|}\) after the defection. But \(2|P^1|+2|P^2|\ge 2|P^1|+|P^2|+1\ge 3|P^1|\), where the last inequality follows from the fact that the numbers of politicians in parties \(P^1\) and \(P^2\) do not differ from each other by more than 1. Thus, any politician belonging to \(P^1\) will not improve her utility through this defection, a contradiction. Third, any defection that results in a \(s^{\prime }\) in which three agendas are supported must be such that at least two agendas supported in s, say those of \(P^2\) and \(P^3\), are also supported in \(s^{\prime }\). That is, some politicians belonging to \(P^2\) and \(P^3\) are not members of the defecting coalition. If the party formed supports an agenda which is different than the agenda supported by \(P_1\) in s, then it has a weight of \(\frac{1}{3}\) (Fig. 7(3)) or \(\frac{1}{6}\) (Fig. 7(4)) depending on the arc on which the agenda is placed. In both cases, there is at least one party with a weight of strictly more than \(\frac{1}{3}\). Therefore, the party formed has zero power and so the defection is not beneficial. If the party formed supports the agenda supported by \(P_1\) in s, then all three agendas supported in s are also supported in \(s^{\prime }\). But such a defection even by a single politician is not beneficial since s is a Nash equilibrium under sincere voting. Finally, any defection that results in a \(s^{\prime }\) in which four agendas are supported must be such that all three agendas supported in s are also supported in \(s^{\prime }\) (note that there does not exist a defection that results in five or more supported agendas). But this cannot be beneficial for the same reasoning as above. Thus there is no credible defection from s by any coalition of politicians.

As a corollary of Theorem 3, we easily obtain the following result:

Corollary 4

For any \(|I|\ge 3\), the set of defection-proof Nash equilibria under sincere voting is nonempty.

4 Strategic voting

In this section, we analyze the case in which voters vote strategically. So now the two stages of our model define a two-stage game. We first look for the subgame-perfect Nash equilibria of this two-stage game. Subsequently, we refine our predictions using defection-proofness.

4.1 Subgame-perfect Nash equilibrium

To define subgame-perfect Nash equilibrium under strategic voting, we need to consider voters’ strategies in all possible Stage II subgames. Note that there are \(A^{|I|}\) possible subgames in Stage II, one corresponding to each strategy profile of the politicians.

Definition 7

(Subgame-perfect Nash equilibrium under strategic voting) The tuple of strategy profiles \(\big (s,(v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\big )\) is a subgame-perfect Nash equilibrium under strategic voting if for all \({\tilde{s}}\in A^{|I|}\), the voters’ strategy profile \(v_{{\tilde{s}}}\) is a Nash equilibrium in the Stage II subgame following \({\tilde{s}}\) in Stage I, and the politicians’ strategy profile s is a Nash equilibrium in the Stage I subgame given Stage II strategy profiles \((v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\).

Since every profile of voters’ strategies constitutes an equilibrium, for any choice of strategies by the politicians \(s\in A^{|I|}\) there exists a subgame-perfect Nash equilibrium such that all parties in \({\mathcal {P}}(s)\) are effective in equilibrium. This implies that any number of effective parties between 1 and |I| and their configuration over the circle are possible in subgame-perfect Nash equilibrium under strategic voting. In order to reduce the high multiplicity of equilibria, we will use the notion of \(\delta \)-defection-proof subgame-perfect Nash equilibrium which considers the possibility of coalitions of voters orchestrating defections.

4.2 \(\delta \)-Defection-proof subgame-perfect Nash equilibrium

A subgame-perfect Nash equilibrium under strategic voting will not be stable if there exists a credible defection by either a coalition of politicians or voters. We therefore now restrict our attention to defection-proof subgame-perfect Nash equilibria. Defection-proofness in our two-stage game requires that there is no credible defection by a coalition of players in either stage:

  1. 1.

    Given Stage II strategy profiles \((v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\), the politicians’ strategy profile s is a defection-proof Nash equilibrium in the Stage I subgame if there is no credible defection from s by any coalition \(J\subseteq I\).

  2. 2.

    The voter’s strategy profile \(v_{s}\) in the Stage II subgame following s in Stage I is a \(\delta \) -defection-proof Nash equilibrium if there is no credible \(\delta \)-defection from \(v_s\).

Definition 8

(\(\delta \) -Defection-proof subgame-perfect Nash equilibrium under strategic voting) The tuple of strategy profiles \(\big (s,(v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\big )\) is a \(\delta \)-defection-proof subgame-perfect Nash equilibrium under strategic voting if for all \({\tilde{s}}\in A^{|I|}\), the voters’ strategy profile \(v_{{\tilde{s}}}\) is a \(\delta \)-defection-proof Nash equilibrium in the Stage II subgame following \({\tilde{s}}\) in Stage I, and the politicians’ strategy profile s is a defection-proof Nash equilibrium in the Stage I subgame given Stage II strategy profiles \((v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\).

It is clear that any \(\delta \)-defection-proof subgame-perfect Nash equilibrium under strategic voting is also a subgame-perfect Nash equilibrium under strategic voting.

Our next result shows that defection-proofness sharply refines the set of subgame-perfect Nash equilibria under strategic voting: Irrespective of the value of \(\delta \), any subgame-perfect Nash equilibrium under strategic voting with three or more effective parties in equilibrium is not \(\delta \)-defection-proof.

Theorem 5

Consider any \(\delta \le 1\). If \(\big (s,(v_{{\tilde{s}}})_{{\tilde{s}}\in A^{|I|}}\big )\) is a \(\delta \)-defection-proof subgame-perfect Nash equilibrium under strategic voting, then there are at most two effective parties under \(v_{s}\).

In the proof, we first argue that \(\delta \)-defection-proof Nash equilibrium requires that almost all voters vote sincerely in the Stage II subgames. If a positive proportion of the voters do not vote sincerely, then an \(\epsilon \) proportion of them could switch their votes to their most-preferred party, making it the unique effective party. This defection is credible when \(\epsilon \) is sufficiently small since then any further defection by a proper subcoalition of the voters will have no impact on the outcome. So suppose almost all voters are voting sincerely and there are three or more effective parties. Pick any two adjacent parties, \(P^1\) and \(P^2\), with \(P^2\) in the clockwise direction of \(P^1\). Due to the continuity of the voter’s utility function, we can always find a positive proportion of the voters located between these two parties and closer to \(P^1\) who prefer that \(P^2\) wins for sure over a lottery in which a party that is even farther then \(P^2\) could gain power. Thus, instead of voting sincerely, if an \(\epsilon \) proportion of these voters defect and vote for \(P^2\), then \(P^2\) will become the unique effective party. For the same reason as mentioned above, this defection is credible when \(\epsilon \) is sufficiently small.

We are unable to prove the existence of \(\delta \)-defection-proof subgame-perfect Nash equilibria under strategic voting when \(\delta \ge 0.5\). However, it is more natural to consider the case when the feasible coalitions of voters are small in size. Specifically, we restrict attention to the case of \(\delta <0.5\) (it is difficult to see how more than half the electorate can come together to identify and agree upon a credible defection). In that case, we have the following result:

Theorem 6

Let \(\delta <0.5\).

  1. (i)

    There exist \(\delta \)-defection-proof subgame-perfect Nash equilibria under strategic voting such that exactly one party is effective in equilibrium.

  2. (ii)

    There exist \(\delta \)-defection-proof subgame-perfect Nash equilibrium under strategic voting such that exactly two parties are effective in equilibrium. In such equilibria, we can obtain any distribution of politicians over the two effective parties as well as any distance between the pair of agendas supported by the two effective parties.

Thus, when \(\delta \) is less than 0.5, the set of \(\delta \)-defection-proof subgame-perfect Nash equilibria under strategic voting is nonempty and can generate both one effective party or two effective parties in equilibrium.

To construct the equilibrium with exactly one effective party, consider any politicians’ strategy profile s such that all politicians support the same agenda a. In order to ensure that no coalition of politicians have an incentive to defect from s, fix the voters’ strategy profiles in the Stage II subgames as follows: If a coalition of politicians switch to supporting some agenda other than a, then the voters punish that coalition by continuing to vote for the remaining party which supports agenda a. This voters’ strategy profile is a \(\delta \)-defection-proof Nash equilibrium in the Stage II subgame because, as \(\delta <0.5\) and all voters vote for the same party, no coalition of voters with measure at most \(\delta \) can change the outcome by defecting.

To construct the equilibrium with exactly two effective parties, consider any politicians’ strategy profile s such that a subset of the politicians support agenda a while the rest support agenda b. In order to ensure that no coalition of politicians have an incentive to defect from s, fix the voters’ strategy profiles in the Stage II subgames as follows: First, if a coalition of politicians in the party supporting one of the agendas, say a, switch to supporting the other agenda b, then the voters punish that coalition by voting only for the remaining party which supports a. Second, if a coalition of politicians form a third party by supporting an agenda other than a or b, then again the voters punish that coalition by voting only for the party supporting a. Again, since \(\delta <0.5\), these voters’ strategy profiles are \(\delta \)-defection-proof subgame perfect Nash equilibria in the respective Stage II subgames. Notice that this argument does not rely on the distance between a and b, and on the size of the two parties supporting these agendas. Thus, we conclude that the \(\delta \)-defection-proof subgame-perfect Nash equilibrium under strategic voting does not place any restriction on (a) the agendas supported by the two effective parties in equilibrium and (b) the distribution of politicians over the two effective parties in equilibrium.

5 Relation to the linear model

It is interesting to contrast the defection-proof equilibria that we obtain in our circular model to those we obtain when the space of agendas is the unit interval.

5.1 Sincere voting

When agendas are the unit interval, there are multiple Nash equilibria under sincere voting with one or more effective parties in equilibrium. For instance, the politicians’ strategy profile in which all politicians choose the midpoint of the interval is obviously a Nash equilibrium under sincere voting. To obtain multiple effective parties in equilibrium, pick any integer n such that \(2\le n\le \frac{|I|}{2}\). Consider a partition \(\{P^1,\ldots , P^n\}\) of I such that \(\big ||P^k|-|P^{k'}|\big |\le 1\) for all \(k,k'\in \{1,\ldots ,n\}\). Now define the politicians’ strategy profile s by placing all politicians in \(P^k\) at \(\frac{2k-1}{2n}\) distance from zero on the unit interval. Then \({\mathcal {P}}(s)=\{P^1,\ldots ,P^n\}\) and, due to sincere voting, all parties have equal weight of \(\frac{1}{n}\). Thus, all parties are effective. Since each party in \({\mathcal {P}}(s)\) has at least two politicians, a deviation by a single politician to an agenda that is not supported in s will ensure that the deviating politician gets zero utility. Moreover, since \(\big ||P^k|-|P^{k'}|\big |\le 1\) for all \(k,k'\), a deviation by a single politician to an agenda that is supported in s will not increase her utility. Thus, s is a Nash equilibrium under sincere voting.

If we now apply defection-proofness, then there is a unique defection-proof Nash equilibrium under sincere voting, which is the one in which all politicians choose the midpoint of the interval. The Nash equilibrium in which all politicians choose the midpoint is clearly defection-proof (and this is the only Nash equilibrium with one effective party). To prove that there are no other defection-proof Nash equilibria, consider any Nash equilibrium with multiple effective parties. Pick the left-most party, which must be effective in equilibrium.Footnote 19 Now, if all the politicians in this left-most party move slightly to the right, then this party will increase its weight, and hence become the only effective party. Moreover, it is easy to show that there is no further defection by any subcoalition of these politicians. Hence, any Nash equilibrium under sincere voting with more than one party is not defection-proof.

5.2 Strategic voting

If we now allow for strategic voting by the voters located on the unit interval, then the results are almost the same as those for the case of the circular agenda space. For the same reasons as before, any choice of strategies by the politicians with any number of effective parties between 1 and |I| can be supported in subgame-perfect Nash equilibrium. Theorem 5 also holds verbatim for this model (the proof is identical too). Thus, none of the subgame-perfect Nash equilibria with three or more effective parties are \(\delta \)-defection-proof for any \(\delta \).

As in Theorem 6, when \(\delta <0.5\), we can show that there exist both types of \(\delta \)-defection-proof subgame-perfect Nash equilibria, viz., those in which only one party is effective and those in which two parties are effective. Among the \(\delta \)-defection-proof subgame-perfect Nash equilibria in which only one party is effective, the single effective party can support any agenda on the line (the proof is identical to that of Theorem 6(i)). However, unlike in the case of the circle, the distance between the agendas supported by the two effective parties in a \(\delta \)-defection-proof subgame-perfect Nash equilibrium cannot be arbitrary. This is because, when the voters’ strategy profile in the Stage II subgame generates multiple effective parties, then such a strategy profile is a \(\delta \)-defection-proof Nash equilibrium in that subgame only if almost all voters vote sincerely over the effective parties.Footnote 20 As a result, if we have two effective parties in equilibrium, and almost all voters must vote sincerely over these two parties, then the two parties must be equidistant from the midpoint.

6 Summary

Our aim in this paper was to study whether Duverger’s Law can find game-theoretic foundations in a spatial model of party formation and electoral competition. As the standard model with a linear set of agendas has the tendency to drive politicians to centrism, we instead adopt the unit circle as the set of agendas. For both sincere voting and strategic voting, we find a large multiplicity of (subgame-perfect) Nash equilibria. We use the notion of defection-proof Nash equilibrium to refine our predictions and we find that defection-proofness refines in the direction predicted by Duverger’s Law: Either two or three parties are effective under sincere voting while either one or two parties are effective under strategic voting. However, these results are only partially consistent with Duverger’s Law since there exist defection-proof Nash equilibria with three parties under sincere voting and with one party under strategic voting.