Skip to main content
Log in

House exchange and residential segregation in networks

  • Original Paper
  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

This paper considers a Schelling model in an arbitrary fixed network where there are no vacant houses. Agents have preferences either for segregation or for mixed neighborhoods. Utility is non-transferable. Two agents exchange houses when the trade is mutually beneficial. We find that an allocation is stable when for two agents of opposite-color each black (white) agent has a higher proportion of neighbors who are black (white). This result holds irrespective of agents’ preferences. When all members of both groups prefer mixed neighborhoods, an allocation is also stable provided that if an agent belongs to the minority (majority), then any neighbor of opposite-color is in a smaller minority (larger majority).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. Segregation also exists between followers of different religions, between men and women in an office canteen, between tourists and locals at a city square, between staff and students in a seminar room, between different nationalities at a conference dinner, between workers with different skills in different firms, or between different species occupying their own territory (Pancs and Vriend 2007; Schelling 1971).

  2. In recent times, racial-ethnic segregation has declined in the United States, but income (or class) segregation has grown (Massey et al. 2009).

  3. Important real-life examples of this model are the assignment of campus housing to students (Abdulkadiroglu and Sonmez 1999; Chen and Sonmez 2002, 2004; Sonmez and Unver 2005) and kidney exchange (Roth et al. 2004).

  4. In the literature on residential segregation, the definition of neighborhood is different. Given that houses are located in a checkerboard network or torus, a von Neumann neighborhood implies that each agent only considers the four adjacent agents as neighbors whilst a Moore neighborhood includes the eight surrounding agents as neighbors.

  5. For any finite set S, |S| is the number of elements belonging to S.

  6. Grauwin et al. (2012), Pancs and Vriend (2007), Schelling (1971) and Zhang (2004a) assume that there are vacant houses; that is, \(|\mathbf {A}|<|\mathbf {H}|\) holds.

  7. Pancs and Vriend (2007) consider the symmetric single-peaked utility function where \(p_{m}=p_{0}=0.5\) and \(u_{l}(\cdot )\) is an increasing linear function on the interval [0, 0.5].

  8. This paper conducts static analysis and uses the cooperative game theory definition of “stable allocation”. Each stable allocation corresponds to a limit point of unperturbed dynamics for the stochastic dynamical theory framework (Young 1998; Zhang 2004b).

  9. The naming follows the notion of p-cohesive groups in Morris (2000) where it is used to study contagion through a myopic best-response rule. A subset is p-cohesive if each element has at least a proportion p of neighbors within the subset.

  10. In the literature on residential segregation, two kinds of neighborhoods are assumed: continuous neighborhoods and bounded neighborhoods as illustrated by the left and middle panels of Fig. 2, respectively.

  11. Part (II) of Theorem 1 is independent of the assumption that the preference for mixed neighborhoods is represented by a symmetric single-peaked or symmetric single-plateaued utility function.

  12. In the left and right panels, \(h(\mathbf {A}_{1})\) and \(h(\mathbf {A}_{2})\) form a counterpart partition of \(\mathbf {H}\) while in the middle panel, \(h(\mathbf {A}_{1})\) and \(h(\mathbf {A}_{2})\) do not form a counterpart partition of \(\mathbf {H}\).

  13. We would like to thank two anonymous referees so much for pointing out these possibilities and encouraging this discussion.

References

  • Abdulkadiroglu A, Sonmez T (1998) Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66:689–701

    Article  Google Scholar 

  • Abdulkadiroglu A, Sonmez T (1999) House allocation with existing tenants. J Econ Theory 88:233–260

    Article  Google Scholar 

  • Ben-Shoham A, Serrano R, Volij O (2004) The evolution of exchange. J Econ Theory 114:310–328

    Article  Google Scholar 

  • Chen Y, Sonmez T (2002) Improving efficiency of on-campus housing: an experimental study. Am Econ Rev 92:1669–1686

    Article  Google Scholar 

  • Chen Y, Sonmez T (2004) An experimental study of house allocation mechanisms. Econ Lett 83:137–140

    Article  Google Scholar 

  • Fagiolo G, Valente M, Vriend NJ (2007) Segregation in networks. J Econ Behav Organ 64:316–346

    Article  Google Scholar 

  • Grauwin S, Bertin E, Lemoy R, Jensen P (2009) Competition between collective and individual dynamics. Proc Natl Acad Sci 106:20622–20626

    Article  Google Scholar 

  • Grauwin S, Goffette-Nagot F, Jensen P (2012) Dynamic models of residential segregation: an analytical solution. J Publ Econ 96:124–141

    Article  Google Scholar 

  • Kandori M, Serrano R, Volij O (2008) Decentralized trade, random utility and the evolution of social welfare. J Econ Theory 140:328–338

    Article  Google Scholar 

  • Massey DS, Rothwell J, Domina T (2009) The changing bases of segregation in the United States. ANN Am Acad Polit Soc Sci 626:74–90

    Article  Google Scholar 

  • Miyagawa E (2002) Strategy-proofness and the core in house allocation problems. Games Econ Behav 38:347–361

    Article  Google Scholar 

  • Morris S (2000) Contagion. Rev Econ Stud 67:57–78

    Article  Google Scholar 

  • Pancs R, Vriend NJ (2007) Schelling’s spatial proximity model of segregation revisited. J Publ Econ 91:1–24

    Article  Google Scholar 

  • Roth A (1982) Incentive compatibility in a market with indivisible goods. Econ Lett 9:127–132

    Article  Google Scholar 

  • Roth A, Postlewaite A (1977) Weak versus strong domination in a market with indivisible goods. J Math Econ 4:131–137

    Article  Google Scholar 

  • Roth A, Sonmez T, Unver U (2004) Kidney exchange. Q J Econ 119:457–488

    Article  Google Scholar 

  • Serrano R, Volij O (2008) Mistakes in cooperation: the stochastic stability of Edgeworth’s recontracting. Econ J 118:1719–1741

    Article  Google Scholar 

  • Schelling TC (1969) Models of segregation. Am Econ Rev 59:488–493

    Google Scholar 

  • Schelling TC (1971) Dynamic models of segregation. J Math Soc 1:143–186

    Article  Google Scholar 

  • Schelling TC (1978) Micromotives and macrobehavior. W. W. Norton & Company, New York

    Google Scholar 

  • Shapley L, Scarf H (1974) On cores and indivisibility. J Math Econ 1:23–37

    Article  Google Scholar 

  • Sonmez T, Unver U (2005) House allocation with existing tenants: an equivalence. Games Econ Behav 52:153–185

    Article  Google Scholar 

  • Vinković D, Kirman A (2006) A physical analogue of the Schelling model. Proc Natl Acad Sci 103:19261–19265

    Article  Google Scholar 

  • Young HP (1998) Individual strategy and social structure: an evolutionary theory of institutions. Princeton University Press, Princeton

    Google Scholar 

  • Zhang J (2004a) A dynamic model of residential segregation. J Math Soc 28:147–170

    Article  Google Scholar 

  • Zhang J (2004b) Residential segregation in an all-integrationist world. J Econ Behav Organ 54:533–550

    Article  Google Scholar 

  • Zhang J (2011) Tipping and residential segregation: a unified Schelling model. J Reg Sci 51:167–193

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiwei Cui.

Additional information

We thank the editor and two anonymous referees for suggesting ways to improve the substance and exposition of this paper. Part of this work was undertaken while Zhiwei Cui was visiting the Department of Applied Mathematics at National Dong Hwa University, whose hospitality is greatly acknowledged. This work was financially supported by the National Science Foundation of China (No. 61202425) and the Fundamental Research Funds for the Central Universities (YWF-13-D2-JC-11, YWF-14-JGXY-016).

Proofs

Proofs

Proof of Proposition 1

According to the specific values of \(\displaystyle \min _{i\in \mathbf {H}^{'}} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}\), the proof is divided into two cases.

Case I \(\displaystyle \min _{i\in \mathbf {H}^{'}} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}=1\).

In this case, \(|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|=\eta _{i}(g)\) holds for any \(i\in \mathbf {H}^{'}\). That is, for any \(i\in \mathbf {H}^{'}\), \(\mathbf {N}_{i}(g)\subset \mathbf {H}^{'}\). Therefore, \(g_{ij}=0\) for any \(i\in \mathbf {H}^{'}\) and \(j\in \mathbf {H}{\setminus }\mathbf {H}^{'}\). Following from the assumption that \(g_{ij}=g_{ji}\) for any \(i,j\in \mathbf {H}\), we have that \(\mathbf {N}_{j}(g)\subset \mathbf {H}{\setminus }\mathbf {H}^{'}\) for any \(j\in \mathbf {H}{\setminus }\mathbf {H}^{'}\). As a result,

$$\begin{aligned} \min _{j\in \mathbf {H}{\setminus }\mathbf {H}^{'}} \frac{|\mathbf {N}_{j}(g)\cap (\mathbf {H}{\setminus }\mathbf {H}^{'})|}{\eta _{j}(g)}=1>0=\max _{i\in \mathbf {N}_{\mathbf {H}{\setminus }\mathbf {H}^{'}}(g)}\frac{|\mathbf {N}_{i}(g)\cap (\mathbf {H}{\setminus }\mathbf {H}^{'})|}{\eta _{i}(g)}. \end{aligned}$$

Case II \(\displaystyle \min _{i\in \mathbf {H}^{'}} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}<1\).

In this case, \(\mathbf {N}_{\mathbf {H}^{'}}(g)\ne \emptyset \) and \(\mathbf {N}_{\mathbf {H}{\setminus } \mathbf {H}^{'}}(g)\ne \emptyset \). First of all, we introduce a lemma to facilitate the proof.

Lemma 3

Consider a house distribution network g. For any proper, nonempty subset of houses \(\mathbf {H}^{''}\subset \mathbf {H}\), if \(\mathbf {N}_{\mathbf {H}^{''}}(g)\ne \emptyset \),

$$\begin{aligned} \min _{i\in \mathbf {N}_{\mathbf {H}{\setminus }\mathbf {H}^{''}}(g)} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{''}|}{\eta _{i}(g)}=\min _{i\in \mathbf {H}^{''}} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{''}|}{\eta _{i}(g)}. \end{aligned}$$

The proof of this lemma is trivial. We omit it here.

We then verify that the subset \(\mathbf {H}{\setminus }\mathbf {H}^{'}\) is internally cohesive as follows.

$$\begin{aligned}&\max _{i\in \mathbf {N}_{\mathbf {H}{\setminus }\mathbf {H}^{'}}(g)}\frac{|\mathbf {N}_{i}(g)\cap (\mathbf {H}{\setminus }\mathbf {H}^{'})|}{\eta _{i}(g)}\\&\quad =\max _{i\in \mathbf {N}_{\mathbf {H}{\setminus }\mathbf {H}^{'}}(g)}\Big (1-\frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}\Big )=1-\min _{i\in \mathbf {N}_{\mathbf {H}{\setminus }\mathbf {H}^{'}}(g)} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}\\&\quad = 1-\min _{i\in \mathbf {H}^{'}}\frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}\\&\quad \le 1-\max _{j\in \mathbf {N}_{\mathbf {H}^{'}}(g)} \frac{|\mathbf {N}_{j}(g)\cap \mathbf {H}^{'}|}{\eta _{j}(g)} =\min _{j\in \mathbf {N}_{\mathbf {H}^{'}}(g)}\Big (1- \frac{|\mathbf {N}_{j}(g)\cap \mathbf {H}^{'}|}{\eta _{j}(g)}\Big )\\&\quad = \min _{j\in \mathbf {N}_{\mathbf {H}{\setminus }(\mathbf {H}{\setminus }\mathbf {H}^{'})}(g)} \frac{|\mathbf {N}_{j}(g)\cap (\mathbf {H}{\setminus }\mathbf {H}^{'})|}{\eta _{j}(g)} = \min _{j\in \mathbf {H}{\setminus }\mathbf {H}^{'}} \frac{|\mathbf {N}_{j}(g)\cap (\mathbf {H}{\setminus }\mathbf {H}^{'})|}{\eta _{j}(g)} \end{aligned}$$

where the “\(\le \)” inequality follows from the internal cohesion of \(\mathbf {H}^{'}\) and the third and the last “\(=\)” inequalities are applications of Lemma 3. \(\square \)

Proof of Proposition 3

Assume that there exists a house \(i_{0}\in \mathbf {H}^{'}\) such that \(\mathbf {N}_{i_{0}}(g)\cap \mathbf {H}^{'}=\emptyset \). Therefore,

$$\begin{aligned} 0\le \min _{i\in \mathbf {H}^{'}} \frac{|\mathbf {N}_{i}(g)\cap \mathbf {H}^{'}|}{\eta _{i}(g)}\le \frac{|\mathbf {N}_{i_{0}}(g)\cap \mathbf {H}^{'}|}{\eta _{i_{0}}(g)}=0. \end{aligned}$$
(5)

On the other hand, according to the nonexistence of isolated houses, \(\mathbf {N}_{i_{0}}(g) \ne \emptyset \). Combining this with \(\mathbf {N}_{i_{0}}(g)\cap \mathbf {H}^{'}=\emptyset \), both \(j\in \mathbf {H}{\setminus } \mathbf {H}^{'}\) and \(j\in \mathbf {N}_{\mathbf {H}^{'}}(g)\) hold for any \(j\in \mathbf {N}_{i_{0}}(g)\). It follows that

$$\begin{aligned} \max _{j\in \mathbf {N}_{\mathbf {H}^{'}}(g)} \frac{|\mathbf {N}_{j}(g)\cap \mathbf {H}^{'}|}{\eta _{j}(g)}\ge \max _{j\in \mathbf {N}_{i_{0}}(g)}\frac{1}{\eta _{j}(g)}\ge \frac{1}{|\mathbf {H}|-1}>0. \end{aligned}$$
(6)

Inequalities (5) and (6) yield a contradiction to the internal cohesion of \(\mathbf {H}^{'}\). \(\square \)

Proof of Lemma 1

Without losing generality, assume that each utility function \(u_{l}(\cdot )\), \(l=1,2\), is symmetric single-plateaued. That is, \(p_{m}<0.5\). Let \(h^{'}\) denote the allocation resulting from h by agents a and b exchanging houses. Depending on the specific positions of houses h(a) and h(b), the proof is divided into two cases.

Case I \(h(a)\in h(\mathbf {A}_{1}){\setminus } \mathbf {N}_{h(\mathbf {A}_{2})}(g)\) or \(h(b)\in h(\mathbf {A}_{2}){\setminus } \mathbf {N}_{h(\mathbf {A}_{1})}(g)\).

It is sufficient to consider the situation \(h(a)\in h(\mathbf {A}_{1}){\setminus } \mathbf {N}_{h(\mathbf {A}_{2})}(g)\). It follows that

$$\begin{aligned} \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}=1 \text { and then } \frac{|\mathbf {N}_{h^{'}(b)}(g)\cap h^{'}(\mathbf {A}_{2})|}{\eta _{h^{'}(b)}(g)}=0. \end{aligned}$$

If \(h(b)\in h(\mathbf {A}_{2}){\setminus } \mathbf {N}_{h(\mathbf {A}_{1})}(g)\), owing to the specification of \(u_{1}\) and \(u_{2}\), \(\pi _{a}(h)=\pi _{a}(h^{'})=0\) and \(\pi _{b}(h)=\pi _{b}(h^{'})=0\). If \(h(b)\in N_{h(\mathbf {A}_{1})}(g)\), \(\pi _{b}(h)>0\) and \(\pi _{b}(h^{'})=0\) hold. According to Definition 1, the exchange is not beneficial.

Case II \(h(a)\in \mathbf {N}_{h(\mathbf {A}_{2})}(g)\), \(h(b)\in \mathbf {N}_{h(\mathbf {A}_{1})}(g)\) and \(g_{h(a)h(b)}=0\).

In this case, it follows that for agent a and agent b,

$$\begin{aligned} \frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)}= & {} \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(b)}(g)}, \end{aligned}$$
(7)
$$\begin{aligned} \frac{|\mathbf {N}_{h^{'}(b)}(g)\cap h^{'}(\mathbf {A}_{2})|}{\eta _{h^{'}(b)}(g)}= & {} \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(a)}(g)}. \end{aligned}$$
(8)

If \(\displaystyle \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}\in [p_{m},1-p_{m}]\) or \(\displaystyle \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(b)}(g)}\in [p_{m},1-p_{m}]\), the exchange between agents a and b is not beneficial. It is sufficient to consider the situation \(\displaystyle \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}\in [p_{m},1-p_{m}]\). \(\pi _{a}(h^{'})\ge \pi _{a}(h)\) implies that \(\displaystyle \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(b)}(g)}\in [p_{m},1-p_{m}]\). It follows that

$$\begin{aligned} \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(b)}(g)} =1-\frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(b)}(g)}\in [p_{m},1-p_{m}]. \end{aligned}$$

Therefore, both agents a and b obtain the highest possible level of utility and have no incentive to exchange their houses.

Now we turn to the situation \(\displaystyle \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}\notin [p_{m},1-p_{m}]\) and \(\displaystyle \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(b)}(g)}\notin [p_{m},1-p_{m}]\). If \(h^{'}\) results from h by agents a and b beneficially exchanging houses,

$$\begin{aligned} \left| \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}-\frac{1}{2}\right| \ge \left| \frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)}-\frac{1}{2}\right| \end{aligned}$$

and

$$\begin{aligned} \left| \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(b)}(g)}-\frac{1}{2}\right| \ge \left| \frac{|\mathbf {N}_{h^{'}(b)}(g)\cap h^{'}(\mathbf {A}_{2})|}{\eta _{h^{'}(b)}(g)}-\frac{1}{2}\right| \end{aligned}$$

where there exists at least one strict inequality. By substituting Eqs. (7) and (8), the above condition can be rewritten as

$$\begin{aligned} \left| \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}-\frac{1}{2}\right| \ge \left| \left( 1-\frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(b)}(g)}\right) -\frac{1}{2}\right| \end{aligned}$$

and

$$\begin{aligned} \left| \frac{|\mathbf {N}_{h(b)}(g)\cap h(\mathbf {A}_{2})|}{\eta _{h(b)}(g)}-\frac{1}{2}\right| \ge \left| \left( 1-\frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}\right) -\frac{1}{2}\right| \end{aligned}$$

where there exists at least one strict inequality. When verifying the above conditions, a contradiction yields. \(\square \)

Proof of Lemma 2

Consider agent a. According to the specification of \(u_{1}(\cdot )\),

$$\begin{aligned} \pi _{a}(h)\le \pi _{a}(h^{'})\Longleftrightarrow \left| \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}-\frac{1}{2}\right| \ge \left| \frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)}-\frac{1}{2}\right| . \end{aligned}$$

Without loss of generality, assume that \(\displaystyle \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)} >\frac{1}{2}\). In this case, \(\pi _{a}(h)\le \pi _{a}(h^{'})\) implies that

$$\begin{aligned} \left\{ \begin{array}{c c} \displaystyle \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}\!\ge \! \frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)} &{} \text {if } \displaystyle \frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)}\!\ge \!\frac{1}{2};\\ \displaystyle \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}-\frac{1}{2}\ge \frac{1}{2}-\frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)} &{} \text {otherwise}.\\ \end{array} \right. \end{aligned}$$

Simplifying the above expression, \(\pi _{a}(h)\le \pi _{a}(h^{'})\) only if

$$\begin{aligned} \frac{|\mathbf {N}_{h(a)}(g)\cap h(\mathbf {A}_{1})|}{\eta _{h(a)}(g)}+ \frac{|\mathbf {N}_{h^{'}(a)}(g)\cap h^{'}(\mathbf {A}_{1})|}{\eta _{h^{'}(a)}(g)}\ge 1. \end{aligned}$$

Hence, Inequality (3) is verified.

The above reasoning also applies to agent b; that is, Inequality (4) holds. Following from Definition 1, the conclusion can be verified. \(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cui, Z., Hwang, YA. House exchange and residential segregation in networks. Int J Game Theory 46, 125–147 (2017). https://doi.org/10.1007/s00182-015-0526-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00182-015-0526-2

Keywords

JEL Classification

Navigation