The present column is devoted to Geometry/Topology.

## I Six new problems – solutions solicited

Solutions will appear in a subsequent issue.

### 252

Prove that the space of unordered couples of distinct points of a circle is the (open) Möbius band. More formally, consider

and the equivalence relation on this space $(x,y)≡(y,x)$; prove that the quotient topological space is the (open) Möbius band.

*Costante Bellettini (Department of Mathematics, University College London, UK)*

### 253

In the Euclidean plane, let $γ_{1}$ and $γ_{2}$ be two concentric circles of radius respectively $r_{1}$ and $r_{2}$, with $r_{1}<r_{2}$. Show that the locus $γ$ of points $P$ such that the polar line of $P$ with respect to $γ_{2}$ is tangent to $γ_{1}$ is a circle of radius $r_{2}/r_{1}$.

### Acknowledgement

I want to thank the professors who guided me in the first part of my career for giving me the ideas for these problems.

*Paola Bonacini (Mathematics and Computer Science Department, University of Catania, Italy)*

### 254

Let $A⊆R_{3}$ be a connected open subset of Euclidean space, and suppose that the following conditions hold:

Every smooth irrotational vector field on $A$ admits a potential (i.e., it is the gradient of a smooth function).

The closure $A$ of $A$ is a smooth compact submanifold of $R_{3}$ (of course, with non-empty boundary).

Show that $A$ is simply connected. Does this conclusion hold even if we drop condition (2) on $A$?

*Roberto Frigerio (Dipartimento di Matematica, Università di Pisa, Italy)*

### 255

A *regulus* is a surface in $R_{3}$ that is formed as follows: We consider pairwise skew lines $ℓ_{1},ℓ_{2},ℓ_{3}⊂R_{3}$ and take the union of all lines that intersect each of $ℓ_{1}$, $ℓ_{2}$, and $ℓ_{3}$.
Prove that, for every regulus $U$, there exists an irreducible polynomial $f∈R[x,y,z]$ of degree two that vanishes on $U$.

*Adam Sheffer (Department of Mathematics, Baruch College, City University of New York, NY, USA)*

### 256

(Enumerative Geometry). How many lines pass through $4$ generic lines in a $3$-dimensional complex projective space $CP_{3}$?

*Mohammad F. Tehrani (Department of Mathematics, University of Iowa, USA)*

### 257

I learned about the following problem from Shmuel Weinberger. It can be viewed as a topological analogue of Arrow’s Impossibility Theorem.

(a) A group of $n$ friends have decided to spend their summer cottaging together on an undeveloped island, which happens to be a perfect copy of the closed 2-disk $D_{2}$. Their first task is to decide where on this island to build their cabin. Being democratically-minded, the friends decide to vote on the question. Each friend chooses his or her favourite point on $D_{2}$. The friends want a function that will take as input their $n$ votes, and give as output a suitable point on $D_{2}$ to build. They believe, to be reasonable and fair, their “choice” function should have the following properties:

(

*Continuity*) It should be continuous as a function $(D_{2})_{n}→D_{2}$. This means, if one friend changes their vote by a small amount, the output will change only a small amount.(

*Symmetry*) The $n$ friends should be indistinguishable from each other. If two friends swap votes, the final choice should be unaffected.(

*Unanimity*) If all $n$ friends chose the same point $x$, then $x$ should be the final choice.

For which values of $n$ does such a choice function exist?

(b) The friends’ second task is to decide where along the shoreline of the island they will build their dock. The shoreline happens to be a perfect copy of the circle $S_{1}$. Again, they decide to take the problem to a vote. For which values of $n$ does a continuous, symmetric, and unanimous choice function $(S_{1})_{n}→S_{1}$ exist?

These are special cases of the following general problem in topological social choice theory: given a topological space $X$, for what values of $n$ does $X$ admit a social choice function that is continuous, symmetric, and unanimous? In other words, when is there a function $A:X_{n}→X$ satisfying

$A$ is continuous,

$A(x_{1},…,x_{n})$ is independent of the ordering of $x_{1},…,x_{n}$, and

$A(x,x,x,…,x)=x$ for all $x∈X$?

*Jenny Wilson (Department of Mathematics, University of Michigan, USA)*

## II Open problem

Embeddings of contact domains

*by Yakov Eliashberg (Department of Mathematics, Stanford University, USA)*

One of the cornerstones of symplectic topology, *Gromov’s non-squeezing theorem*, see [6
M. Gromov, Pseudo holomorphic curves in symplectic manifolds.
Invent. Math. 82, 307–347 (1985)
], asserts that for $n>1$ the ball of radius $R>1$ in the standard symplectic space $(R_{2n},ω=∑_{1}dx_{j}∧dy_{j})$ does not admit a symplectic embedding into the domain

while there is no volume constraints to do that. Since that time, the theory of symplectic embedding has made a lot of progress (see F. Schlenk’s survey [8 F. Schlenk, Symplectic embedding problems, old and new. Bull. Amer. Math. Soc. (N.S.) 55, 139–182 (2018) ] for recent results).

The (non-)embedding results in contact geometry, which is an odd-dimensional analogue of symplectic geometry, are rarer; below, we discuss a few open problems.

Recall that a contact structure $ξ$ on an $(2n+1)$-dimensional manifold $M$ is a completely non-integrable hyperplane field. If $ξ$ is defined by a Pfaffian equation $α=0$ for a differential $1$-form $α$ (and such a form can always be found locally, and if $ξ$ is co-orientable even globally) then the complete non-integrability can be expressed by the condition that $α∧dα_{n}$ is a non-vanishing $(2n+1)$-form on $M$.

In this set of problems, we will restrict our attention to domains in the contact manifold $X:−R_{2n}×S_{1}$, $S_{1}=R/Z$, endowed with the contact structure

Given a *bounded* domain $U⊂R_{2n}$, we set

and refer to $U^$ as a *quantized* domain $U$.
We say that a domain $U^_{1}$ admits a *contact embedding* into a domain $U^_{2}$ if *there is a contact isotopy $f_{t}:U^_{1}→X$, starting with the inclusion $f_{0}:U^_{1}↪X$ such that $f_{1}(U^_{1})⊂U^_{2}$.*
Note that any Hamiltonian isotopy which moves $U_{1}$ into $U_{2}$ lifts to a contact isotopy moving $U^_{1}$ into $U^_{2}$.
Hence we will refer to the problem of contact embeddings between the domains $U^_{1}$ and $U^_{2}$ as a quantized version of the corresponding symplectic embedding problem of $U_{1}$ to $U_{2}$.

Denote by $B_{2n}(R)$ the $2n$-dimensional open ball of radius $R$ and by $P(r_{1},…,r_{k})$ the polydisk $B_{2}(r_{1})×⋯×B_{2}(r_{n})⊂R_{2n}$, where $0<r_{1}≤r_{2}≤⋯≤r_{n}$.
It was shown in [3
Y. Eliashberg, S. S. Kim and L. Polterovich, Geometry of contact transformations and domains: orderability versus squeezing.
Geom. Topol. 10, 1635–1747 (2006)
] that *if $πr_{1}<k<πr_{2}$ for any integer $k≥1$, then $B^_{2n}(r_{2})$ does not admit a contact embedding into $B^_{2n}(r_{1})$.*
Another theorem from [3
Y. Eliashberg, S. S. Kim and L. Polterovich, Geometry of contact transformations and domains: orderability versus squeezing.
Geom. Topol. 10, 1635–1747 (2006)
] states that *if $πR_{2}<1$, then $B^_{2n}(R)$ admits a contact embedding into $B^_{2n}(r)$ for any $r>0$*.
The former result was improved in [2
S.-F. Chiu, Nonsqueezing property of contact balls.
Duke Math. J. 166, 605–655 (2017)
, 5
M. Fraser, Contact non-squeezing at large scale in ℝ2n×S1.
Internat. J. Math. 27, 1650107 (2016)
] to show that for any $r_{1}<r_{2}$ with $πr_{2}>1$ there is no contact embedding of $B^_{2n}(r_{2})$ into $B^_{2n}(r_{1})$.
Recall that Gromov’s *symplectic width*$Width_{Gr}(U)$ of a domain $U⊂R_{2n}$ can be defined as the supremum of $πρ_{2}$ such that $B_{2n}(ρ)$ can be symplectically embedded into the domain $U$.
The above results can be slightly generalized to the following statement, see [3
Y. Eliashberg, S. S. Kim and L. Polterovich, Geometry of contact transformations and domains: orderability versus squeezing.
Geom. Topol. 10, 1635–1747 (2006)
].

*If, for two domains $U_{1},U_{2}⊂R_{2n}$, we have*

*then the quantized domain $U^_{2}$ does not admit a contact embedding into $U^_{1}$.*

Very little is known about embeddings of contact domains beyond the above results. Let us formulate a couple of concrete problems concerning quantized versions of some relatively old embedding results in symplectic topology. As we already mentioned above, many new obstructions to symplectic embeddings were found in recent years. It is unknown whether any of them hold in the quantized versions.

### 258*

**Contact packing problem****.** *Suppose that $πR_{2}>πr_{2}>1$.
Is there a maximal number of quantized balls $B^_{2n}(r)$ which admit a contact packing into $B^_{2n}(R)$?
And if the answer is “yes”, then what is this number?*

Here we say that $B^_{2n}(R)$ admits a *contact packing* by $k$ quantized balls $B^_{2n}(r)$ if the disjoint union

admits a contact embedding into $B^_{2n}(R)$.
Note that the corresponding *symplectic packing* problem was intensively studied beginning with the seminal paper by Gromov [6
M. Gromov, Pseudo holomorphic curves in symplectic manifolds.
Invent. Math. 82, 307–347 (1985)
], where he proved that the packing of the ball $B_{2n}(R)$ with 2 disjoint balls $B_{2n}(r)$ is possible if and only if $R_{2}>2r_{2}$.
For $n=2$, the problem was significantly advanced by D. McDuff and L. Polterovich in [7
D. McDuff and L. Polterovich, Symplectic packings and algebraic geometry.
Invent. Math. 115, 405–434 (1994)
], and then completely solved by P. Biran in [1
P. Biran, Symplectic packing in dimension 4.
Geom. Funct. Anal. 7, 420–437 (1997)
].
In the contact case, Problem 258* is completely open.

### 259*

**Rotating quantized polydisks****.** *For $r<R$, consider the standard contact inclusion $(x,y)↦(−y,x)$.
Let $j^ =j×Id$, $ψ^ =ψ×Id$ be the corresponding contact inclusion $P^(r,r)→P^(R,R)$, and consider the contactomorphism $ψ×Id:X=R_{2n}×S_{1}→R_{2n}×S_{1}=X$.
When are the embeddings $j^ ,ψ^ ∘j^ :P^(r,r)↪P^(R,R)$ contact isotopic?*

Note that a theorem of Floer–Hofer–Wysocki, see [4 A. Floer, H. Hofer and K. Wysocki, Applications of symplectic homology. I. Math. Z. 217, 577–606 (1994) ], states that when $2r_{2}>R_{2}$ the symplectic embeddings $j,ψ:P(r,r)→P(R,R)$ are not symplectically isotopic.

## III Solutions

### 245

We consider a setting where there is a set of $m$ candidates

and a set of $n$ voters $[n]={1,…,n}$.
Each voter ranks all candidates from the most preferred one to the least preferred one; we write $a≻_{i}b$ if voter $i$ prefers candidate $a$ to candidate $b$.
A collection of all voters’ rankings is called a *preference profile*.
We say that a preference profile is *single-peaked* if there is a total order $⊲$ on the candidates (called the *axis*) such that for each voter $i$ the following holds: if $i$’s most preferred candidate is $c$ and $a⊲b⊲c$ or $c⊲b⊲a$, then $b≻_{i}a$.
That is, each ranking has a single “peak”, and then “declines” in either direction from that peak.

(i) In general, if we aggregate voters’ preferences over candidates, the resulting majority relation may have cycles: e.g., if $a≻_{1}b≻_{1}c$, $b≻_{2}c≻_{2}a$ and $c≻_{3}a≻_{3}b$, then a strict majority (2 out of 3) voters prefer $a$ to $b$, a strict majority prefer $b$ to $c$, yet a strict majority prefer $c$ to $a$. Argue that this cannot happen if the preference profile is single-peaked. That is, prove that if a profile is single-peaked, a strict majority of voters prefer $a$ to $b$, and a strict majority of voters prefer $b$ to $c$, then a strict majority of voters prefer $a$ to $c$.

(ii) Suppose that $n$ is odd and voters’ preferences are known to be single-peaked with respect to an axis $⊲$. Consider the following voting rule: we ask each voter $i$ to report their top candidate $t(i)$, find a median voter $i_{∗}$, i.e.,

and output $t(i_{∗})$. Argue that under this voting rule no voter can benefit from voting dishonestly, if a voter $i$ reports some candidate $a=t(i)$ instead of $t(i)$, this either does not change the outcome or results in an outcome that $i$ likes less than the outcome of the truthful voting.

(iii) We say that a preference profile is *1D-Euclidean* if each candidate $c_{j}$ and each voter $i$ can be associated with a point in $R$ so that the preferences are determined by distances, i.e., there is an embedding $x:C∪[n]→R$ such that for all $a,b∈C$ and $i∈[n]$, we have $a≻_{i}b$ if and only if $∣x(i)−x(a)∣<∣x(i)−x(b)∣$.
Argue that a 1D-Euclidean profile is necessarily single-peaked.
Show that the converse is not true, i.e., there exists a single-peaked profile that is not 1D-Euclidean.

(iv) Let $P$ be a single-peaked profile, and let $L$ be the set of candidates ranked last by at least one voter. Prove that $∣L∣≤2$.

(v) Consider an axis $c_{1}⊲⋯⊲c_{m}$. Prove that there are exactly $2_{m−1}$ distinct votes that are single-peaked with respect to this axis. Explain how to sample from the uniform distribution over these votes.

These problems are based on references [12 H. Moulin, Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1991) ] (parts (i) and (ii)), [10 C. H. Coombs. Psychological scaling without a unit of measurement. Psychological Review 57, 145 (1950) ] (part (iii)) and [9 V. Conitzer, Eliciting single-peaked preferences using comparison queries. J. Artificial Intelligence Res. 35, 161–191 (2009) , 13 T. Walsh, Generating single peaked votes. arXiv:1503.02766 (2015) ] (part (v)); part (iv) is folklore. See also the survey [11 E. Elkind, M. Lackner and D. Peters. Structured preferences. In Trends in Computational Social Choice, edited by U. Endriss, Chapter 10, AI Access, 187–207 (2017) ].

*Edith Elkind (University of Oxford, UK)*

#### Solution by the proposer

(i) We can restrict the voters’ preferences to the set ${a,b,c}$; the reader can check that a restriction of a single-peaked profile to a subset of candidates remains single-peaked. We consider three cases depending on how $a$, $b$ and $c$ are ordered by the axis $⊲$.

$a⊲b⊲c$ or $c⊲b⊲a$. Then all voters who prefer $a$ over $b$ have $a$ as their top choice and hence prefer $a$ to $c$.

$b⊲a⊲c$ or $c⊲a⊲b$. All voters who prefer $c$ over $a$ have $c$ as their top choice and hence prefer $a$ to $b$; therefore, these voters are in minority.

$a⊲c⊲b$ or $b⊲c⊲a$. This is impossible: all voters who prefer $b$ to $c$ have $b$ as their top choice, so we have a strict majority preferring $b$ over $a$, a contradiction.

(ii) Suppose the winner under truthful voting is $a$. Consider a voter $i$. If $t(i)=a$, then $i$ cannot improve the outcome by lying. So suppose $t(i)⊲a$ (the case $a⊲t(i)$ is symmetric). If $i$ reports $a$ or some candidate $b$ with $b⊲a$, this does not change what the top choice of the median voter is, and hence does not change the outcome. If $i$ reports a candidate $c$ with $t(i)⊲c$, then the median voter may shift to the right, i.e., further away from $i$’s true top choice; as $i$’s preferences are single-peaked, this does not improve the outcome from her perspective.

(iii) Ordering the candidates by their position, i.e., placing $a$ before $b$ on the axis $⊲$ if $x(a)<x(b)$ results in an axis witnessing that the input profile is single-peaked. To show that the converse is not true, consider the following four votes:

This profile is single-peaked on $a⊲b⊲c⊲d$. Now, suppose for contradiction that it is 1D-Euclidean, i.e., it admits an embedding $x$. Consider the positions of the four voters $x(1),x(2),x(3),x(4)$. Assume without loss of generality that $x(b)<x(c)$. Then we have

(as voters 1 and 3 prefer $b$ to $c$) and

(as voters 2 and 4 prefer $b$ to $c$). But now consider the point $21 (x(a)+x(d))$. Voters 1 and 2 have to be on one side of this point and voters 3 and 4 have to be on the other side of this point, because of their preferences over $a$ vs. $d$. But this is clearly impossible!

(iv) Assume without loss of generality that $P$ is single-peaked with respect to the axis $c_{1}⊲⋯⊲c_{m}$. Clearly, $P$ may contain a vote that ranks $c_{1}$ last or a vote that ranks $c_{m}$ last. But it cannot contain a vote that ranks some $c_{i}$ with $1<i<m$ last: if the top candidate in that vote is a $c_{j}$ with $j<i$, then this voter prefers $c_{i}$ to $c_{m}$, and if the top candidate in that vote is a $c_{k}$ with $k>i$, then this voter prefers $c_{i}$ to $c_{1}$.

(v) Induction. For $m=2$, we have $2=2_{2−1}$ orders, i.e., $c_{1}≻c_{2}$ and $c_{2}≻c_{1}$. Now suppose the claim has been proved for all $m_{′}<m$. A vote that is single-peaked on $c_{1}⊲⋯⊲c_{m}$ may have $c_{1}$ in the last position, with candidates in top $m−1$ positions forming a single-peaked vote with respect to $c_{2}⊲⋯⊲c_{m}$ ($2_{m−2}$ options) or it may have $c_{m}$ in the last position, with candidates in top $m−1$ positions forming a single-peaked vote with respect to $c_{1}⊲⋯⊲c_{m−1}$ ($2_{m−2}$ options). For sampling, we can build the vote bottom-up. At the first step, we fill the last position with $c_{1}$ or $c_{m}$, with probability $21 $ each. Once $k$ positions have been filled, $1≤k≤m−1$, the not-yet-ranked candidates form a contiguous segment $c_{1}⊲⋯⊲c_{j}$ of the axis. We then fill position $k+1$ from the bottom with $c_{i}$ or $c_{j}$, with equal probability. This sampling is uniform, because the probability of generating a specific ranking is exactly $2_{−m+1}$: we make $m−1$ choice, and with probability $21 $ each choice is consistent with the target ranking.

### 246

Consider a standard prisoners’ dilemma game described by the following strategic form, with $δ>β>0>γ$:

Assume that any given agent either plays $C$ or $D$ and that agents reproduce at a rate determined by their payoff from the strategic form of the game plus a constant $f$. Suppose that members of an infinite population are assorted into finite groups of size $n$. Let $q$ denote the proportion of agents playing strategy $C$ (“altruists”) in the population as a whole and $q_{i}$ denote the proportion of agents playing $C$ in group $i$. We assume that currently $q∈(0,1)$.

The process of assortment is abstract, but we assume that it has finite expectation $E[q_{i}]=q$ and variance $Var[q_{i}]=σ_{2}$. Members within each group are then randomly paired off to play one iteration of the prisoners’ dilemma against another member of their group. All agents then return to the overall population.

Find a condition relating $q$, $σ_{2}$, $β$, $γ$, $δ$ and $n$ under which the proportion of altruists in the overall population rises after a round of play.

Now interpret this game as one where each player can confer a benefit $b$ upon the other player by individually incurring a cost $c$, with $b>c>0$, so that $β=b−c$, $δ=b$ and $γ=−c$. Prove that, as long as (i) there is some positive assortment in group formation and (ii) the ratio $bc $ is low enough, then the proportion of altruists in the overall population will rise after a round of play.

*Richard Povey (Hertford College and St Hilda’s College, University of Oxford, UK)*

#### Solution by the proposer

(a) We can firstly see that the number of altruists (type $C$) and non-altruists (type $D$) in group $i$ after a round of play will be given by

Summing these two equalities yields

Given an infinite population and hence an infinite number of groups, the new proportion of altruists in the overall population will be

Substituting in $E[q_{i}]=σ_{2}+E[q_{i}]_{2}$ and $E[q_{i}]=q$ gives us

Assuming $f$ is high enough to make the denominator positive, it then follows that

After some further rearrangement, we can derive the following:

Since the right-hand side of (1) must be strictly between $0$ and $1$, this has the intuitive interpretation that the *inter-group* variance $σ_{2}$ must be sufficiently high relative to the *intra-group* variance^{1}This is the variance of the Bernoulli variable $B(q)$ which takes a value of $1$ of a single individual drawn from the population is an altruist and $0$ otherwise, which is $q(1−q)$. so that, although altruists do less well relative to non-altruists *within each group*, the concentration of altruists together within *particular* groups is sufficiently strong to confer enough of an evolutionary advantage to offset this and to enable altruists to do better evolutionarily than non-altruists in the overall population.^{2}This result was first proved in a general evolutionary context by George R. Price [16
G. R. Price,
Selection and covariance,
Nature 227, 520–521 (1970)
, 17
G. R. Price,
Extension of covariance selection mathematics,
Ann. Human Genetics 35, 485–490 (1972)
].

(b) In the case where $β=b−c$, $δ=b$ and $γ=−c$, condition (1) can be rearranged to give

With random assortment, $q_{i}$ would be equal to $nX_{i} $ where $X_{i}$, the number of altruists in group $i$ would have a binomial distribution: $X_{i}∼B(n,q)$. Therefore

With perfect positive correlation between group members, we would get

With some positive assortment generating positive covariance between group members, we may therefore without loss of generality suppose that

where $ε∈(0,1)$.
Plugging this into (2) and simplifying, we get
$bc <ε$.
So we can see that for any $ε>0$ there always exists a value of $bc $ low enough for altruists to expand as a proportion of the overall population.^{3}The literature on this model has further established the results that *multiple* periods of isolation in finite groups acts to *amplify* inter-group variance, so that even with random assortment into groups altruism can evolve [14
B. Cooper and C. Wallace,
Group selection and the evolution of altruism.
Oxford Economic Papers 56, 307–330 (2004)
].
It has also been found that use of punishment strategies in dynamic interactions can act to weaken this group selection mechanism [15
R. Povey,
Punishment and the potency of group selection,
J. Evolutionary Economics 24 (2014)
].
For an accessible book-length treatment of the topic of group selection in the biological and social sciences, see [18
E. Sober and D. S. Wilson,
Unto Others,
Harvard University Press, Cambridge, Massachusetts (1999)
].

### 247

Consider a village consisting of n farmers who live along a circle of length $n$. The farmers live at positions $1,2,…,n$. Each of them is friends with the person to the left and right of them, and each friendship has capacity $m$ where $m$ is a non-negative integer. At the end of the year, each farmer does either well (her wealth is $+1$ dollars) or not well (her wealth is $−1$ dollars) with equal probability. Farmers’ wealth realizations are independent of each other. Hence, for a large circle the share of farmers in each state is on average $1$.

The farmers share risk by transferring money to their direct neighbors. The goal of risk-sharing is to create as many farmers with OK wealth (0 dollars) as possible. Transfers have to be in integer dollars and cannot exceed the capacity of each link (which is $m$).

A few examples with a village of size $n=4$ serve to illustrate risk-sharing.

Consider the case where farmers 1 to 4 have wealth

$(+1,−1,+1,−1).$In that case, we can share risk completely with farmer $1$ sending a dollar to agent $2$ and farmer $3$ sending a dollar to farmer $4$. This works for any $m≥1$.

Consider the case where farmers $1$ to $4$ have wealth

$(+1,+1,−1,−1).$In that case, we can share risk completely with farmer $1$ sending a dollar to farmer $2$, farmer $2$ sending two dollars to farmer $3$ and farmer $3$ sending one dollar to farmer $4$. In this case, we need $m≥2$. If $m=1$, we can only share risk among half the people in the village.

Show that for any wealth realization an optimal risk-sharing arrangement can be found as the solution to a maximum flow problem.

*Tanya Rosenblat (School of Information and Department of Economics, University of Michigan, USA)*

#### Solution by the proposer

We augment the village graph by adding two auxiliary nodes.
The *source node*$s$ is connected to all the farmers with positive wealth ($+1$) and each of these links has capacity $1$.
The *sink node*$t$ is connected to all the farmers with negative wealth ($−1$) and each of these links also capacity $1$.
We now look for the *maximum flow* from $s$ to $t$: this is equal to the number of luck/unlucky farmer pairs who can be matched under the best risk-sharing arrangement.

### 248

This exercise is a continuation of Problem 247 where we studied risk-sharing among farmers who live on a circle village and are friends with their direct neighbors to the left and right with friendships of a certain capacity. Assume that for any realization of wealth levels the best possible risk-sharing arrangement is implemented and denote the expected share of unmatched farmers with $U(n,m)$. Show that $U(n,m)→2m+11 $ as $n→∞$.

*Tanya Rosenblat (School of Information and Department of Economics, University of Michigan, USA)*

#### Solution by the proposer

The solution proceeds in two stages. In Problem 247, we already established that the problem can be understood as a maximum flow problem. We first formulate a particular algorithm that implements this flow. We then use this algorithm to express $U(n,m)$ in closed form.

#### Risk-sharing as a Maximum Flow Problem

We next describe a matching algorithm which is to run for $m$ rounds. The claim is that this algorithm implements the maximum flow in the augmented graph for any $m$. For the purpose of this algorithm, we call a black agent an agent with positive shock and a white agent an agent with a negative shock.

*Step I*: Index all agents from $1$ to $n$ clockwise ($1$ is the neighbor of $n$ on a circle).
Set the counter $i$ to $1$.

*Step II*: If agents $i$ and $i+1$ are of different colors, label them “matched” and move the counter clockwise to $i+2$.
If agent $i+1$ has the same color as agent $i$, then declare agent $i$ “unmatched” and move the counter clockwise to agent $i+1$.
Repeat this step until the counter has reached the first agent again.

*Step III*: Define a new circle by ordering all the unmatched agents on a circle without disturbing the order of the agents.
Essentially, this implies that all the matched agents are simply removed from the circle and any gaps are plugged by connected the closest unmatched agents with each other.
Repeat steps I and II for this new circle.
Repeat this algorithm $m$ times.

**Lemma 1****.** *The above matching algorithm implements the maximum flow.*

*Proof.*
The Ford–Fulkerson algorithm computes the maximum flow by looking for open paths which can carry positive flow and then constructing a graph with augmented capacities in which the next path is found, etc.
Once no more open path exists the max flow has been implemented.
The above algorithm implements Ford–Fulkerson using a particular order of selecting open paths.
Therefore, it implements the max flow.

*Closed form solutions.* We next prove the following lemma.

**Lemma 2****.** *Assume we have a circle of size $n$ where the probability that an agent has a neighbor of the same color is $α$.
Then the share of unmatched agents after one round of the above algorithm converges to $2−αα $ as $n→∞$.*

*Proof.*
In each instance of step I of the algorithm, it produces an unmatched agent with probability $α$ and a pair of matched agents with probability $1−α$.
The sum of unmatched and matched agents has to be $n$.
Therefore the share of unmatched agents converges to

The final step in the proof of the result is to derive the probability $α_{m}$ that an agent is followed by a same-color agent in round $m$. We know that in round $1$ shocks are i.i.d.; therefore $α_{1}=21 $. We start by proving a recursive formula for calculating $α_{m}$.

**Lemma 3****.** *If the sequential probability is $α_{m}$ in round $m$, then the sequential probability in round $m+1$ satisfies*

*Proof.*
Consider an agent $i$ on whom the counter rested at some point in the algorithm and who stays unmatched in the current round.
This must be because he has a neighbor $i+1$ of the same color (without loss of generality assume both are black).
With probability $α_{m}$ agent $i+2$ is also black and therefore agent $i+1$ will survive into round $m+1$ as well and be of the same color as agent $i$ (black).
With probability $1−α_{m}$ agent $i+2$ is white.
In this case agents $i+1$ and $i+2$ can be matched.
Matching can continue for the subsequent pairs of agents $(i+3,i+4)$, $(i+5,i+6)$, etc.; it will only stop if for any of these pairs agents have the same color.
This will happen with probability $α_{m}$.
To figure out it if this process will stop at a “white pair” or a “black pair” (let’s call it the “blocking pair”) it is crucial to know whether agent $i+2$, $i+4$, $i+6$, etc. (i.e., the agent just prior to the blocking pair) is white or black.

We know that agent $i+2$ is white. What is the probability that agent $i+4$ is the same color (provided $(i+3,i+4)$ is not a blocking pair)? This can only happen if the pair $(i+3,i+4)$ is a black agent followed by a white agent. If it is a white agent followed by a black agent then $i+4$ has a different color from $i+2$. So the probability of a color change is

Assume that the probability that the agent prior to the blocking pair is of the same color as $i+2$ is $q$. With probability $α_{m}$ the pair $(i+3,i+4)$ is a blocking pair and with probability $1−α_{m}$ the pair is not blocking. In that case agent $i+4$ has a different color from agent $i+2$ with probability $α_{m}$. Because of the recursive nature of the problem, the probability that the agent prior to the blocking pair has the same color as $i+4$ is $q$. Therefore we know that

This allows us to calculate $q$ as

So we know that the agent prior to the blocking pair is white with probability $q$. The blocking pair is therefore a black blocking pair with probability $q(1−α_{m})+(1−q)α_{m}$. Therefore the total probability that the next unmatched agent after agent $i$ is of the same color (black in this case) is

We can check that $α_{m}=1−2m1 $ satisfies both the initial condition and the recursive equation 3. This implies that

Finally, note that the share of unmatched agents (for $n→∞$) can be calculated by taking the product of the share of unmatched agents in each round:

### 249

In a *combinatorial auction* there are $m$ items for sale to $n$ buyers.
Each buyer $i$ has some valuation function $v_{i}(⋅)$ which takes as input a set $S$ of items and outputs that bidder’s value for that set.
These functions will always be monotone ($v_{i}(S∪T)≥v_{i}(S)$ for all $S,T$), and satisfy $v_{i}(∅)=0$.

**Definition 1** (Walrasian equilibrium)**.** A price vector $p ∈R_{≥0}$ and a list $B_{1},…,B_{n}$ of subsets of $[m]$ form a *Walrasian equilbrium* for $v_{1},…,v_{n}$ if the following two properties hold:

Each $B_{i}∈gmax_{S}{v_{i}(S)−∑_{j∈S}p_{j}}$.

The sets $B_{i}$ are disjoint, and $⋃_{i}B_{i}=[m]$.

Prove that a Walrasian equilibrium exists for $v_{1},…,v_{n}$ if and only if there exists an integral^{4}That is, a point such that each $x_{i,S}∈{0,1}$. optimum to the following linear program:

*Hint.*
Take the dual, and start from there.

*Matt Weinberg (Computer Science, Princeton University, USA)*

#### Solution by the proposer

First, we take the dual of the given LP. We use the dual variable $p_{j}$ for the constraints involving items, and the dual variable $u_{i}$ for the constraints involving bidders. Then the dual problem is

#### Walrasian equilibrium implies integral optimum

Now, assume that a Walrasian equilibrium exists, and let it be $p_{1},…,p_{m}$ and $B_{1},…,B_{n}$. Then consider the integral solution to the LP that sets $x_{i,B_{i}}=1$ for all $i$, and all other variables to $0$. This solution is clearly feasible for the LP, and has objective value equal to $∑_{i}v_{i}(B_{i})$.

Consider also the dual solution $u_{i}:−v_{i}(B_{i})−∑_{j∈B_{i}}p_{j}$, with $p_{j}$ as given in the Walrasian equilibrium. We claim this is a feasible solution to the dual. To see this, observe first that each $p_{j}≥0$. Also, because $B_{i}∈gmax_{S}{v_{i}(S)−∑_{j∈S}p_{j}}$ by definition of Walrasian equilibrium, we have that

Therefore, all dual constraints are satisfied, and this is a feasible dual. Moreover, observe that the value of the dual objective is

The last equality follows because each item is in exactly one bundle $B_{i}$. So we have proved that if $(p ,B)$ is a Walrasian equilibrium, then there is an integral feasible point for the LP with objective value $∑_{i}v_{i}(B_{i})$, and also a feasible dual solution with value $∑_{i}v_{i}(B_{i})$. By LP duality, both feasible solutions are in fact optimal. Therefore, there is an integral optimum for the LP.

#### Integral optimum implies Walrasian equilibrium

Now, assume that the LP has an integral optimum. Observe that for this integral solution, there must exist disjoint sets $B_{1},…,B_{n}$ such that for each $i$, $x_{i,B_{i}}=1$ and all other variables are $0$. The LP value for this solution is $∑_{i}v_{i}(B_{i})$. Moreover, observe that if any item $j∈/∪_{i}B_{i}$, we can add $j$ to an arbitrary $B_{i}$ without decreasing $∑_{i}v_{i}(B_{i})$ (because each $v_{i}(⋅)$ is monotone). Therefore, if there is an integral optimum to the LP, there exist disjoint $B_{1},…,B_{n}$ such that $∪_{i}B_{i}=[m]$ and $∑_{i}v_{i}(B_{i})$ is the optimal solution to the LP.

By Strong LP Duality, there also exists a feasible dual solution $p_{1},…,p_{m},u_{1},…,u_{n}$ such that $∑_{i}u_{i}+∑_{j}p_{j}=∑_{i}v_{i}(B_{i})$. We will claim that $(p ,B)$ form a Walrasian equilibrium.

For a proof by contradiction, assume that this is not the case. Then there must be some bidder $i$ such that $B_{i}∈/gmax_{S}{v_{i}(S)−∑_{j∈S}p_{j}}$. In particular, this means that there exists some $B_{i}$ such that $v_{i}(B_{i})−∑_{j∈B_{i}}>v_{i}(B_{i})−∑_{j∈B_{i}}$. Because $u_{i}$ is a feasible solution for the dual, we then conclude that

We claim that this contradicts the fact that $∑_{i}u_{i}+∑_{j}p_{j}=∑_{i}v_{i}(B_{i})$, since

The first inequality holds because $u_{i}≥v_{i}(B_{i})−∑_{j∈B_{i}}p_{j}$ for all $i$, and the inequality is strict for at least one $i$. Therefore, $(p ,B)$ must be a Walrasian equilibrium.

#### Wrapup

This concludes the proof. We have shown that there is an integral optimum to the LP if and only if a Walrasian equilibrium exists. The solution to this problem is given by Nisan et al. in [24 N. Nisan, T. Roughgarden, É. Tardos and V. V. Vazirani, Algorithmic game theory. Cambridge University Press (2007) , Corollary 11.16]; they cite [22 S. Bikhchandani and J. W. Mamer, Competitive equilibrium in an exchange economy with indivisibilities. J. Econom. Theory 74, 385–413 (1997) , 23 S. Bikhchandani and J. M. Ostroy, The package assignment model. J. Econom. Theory 107, 377–406 (2002) ].

### 250

Consider a game played on a network and a finite set of players $N={1,2,…,n}$.^{5}For an overview of the literature on network games, see [20
M. O. Jackson and Y. Zenou,
Games on networks.
In Handbook of Game Theory. Vol. 4,
edited by H. P. Young and S. Zamir,
Handbooks in Economics, 91–157,
Elsevier/North-Holland, Amsterdam (2015)
].
Each node in the network represents a player and edges capture their relationships.
We use $G=(g_{ij})_{1≤i,j≤n}$ to represent the adjacency matrix of a undirected graph/network, i.e., $g_{ij}=g_{ji}∈{0,1}$.
We assume $g_{ii}=0$.
Thus, $G$ is a zero-diagonal, squared and symmetric matrix.
Each player, indexed by $i$, chooses an action $x_{i}∈R$ and obtains the following payoff:

The parameter $δ>0$ captures the strength of the direct links between different players. For simplicity, we assume $0<δ<n−11 $.

A Nash equilibrium is a profile $x_{∗}=(x_{1},…,x_{n})$ such that, for any $i=1,…,n$,

In other words, at a Nash equilibrium, there is no profitable deviation for any player $i$ choosing $x_{i}$.

Let $w=(w_{1},w_{2},…,w_{n})_{′}$, $w_{i}>0$ for all $i$ (the transpose of a vector $w$ is denoted by $w_{′}$), and $I_{n}$ the $n×n$ identity matrix.
Define the *weighted* Katz–Bonacich centrality vector as

Here $M:−[I−δG]_{−1}$ denote the inverse Leontief matrix associated with network $G$, while $m_{ij}$ denote its $ij$ entry, which is equal to the discounted number of walks from $i$ to $j$ with decay factor $δ$.
Let $1_{n}=(1,1,…,1)_{′}$ be a vector of $1$s.
Then the *unweighted* Katz–Bonacich centrality vector can be defined as

Show that this network game has a unique Nash equilibrium $x_{∗}(G)$. Can you link this equilibrium to the Katz–Bonacich centrality vector defined above?

Let $x_{∗}(G)=∑_{i=1}x_{i}(G)$ denote the sum of actions (total activity) at the unique Nash equilibrium in part 1. Now suppose that you can remove a single node, say $i$, from the network. Which node do you want to remove such that the sum of effort at the new Nash equilibrium is reduced the most? (Note that, after the deletion of node $i$, we remove all the links of node $i$, and the remaining network, denoted by $G_{−i}$, can be obtained by deleting the $i$-th row and $i$-th column of $G$.)

Mathematically, you need to solve the

*key player problem*^{6}The key player problem has been introduced in [19 C. Ballester, A. Calvó-Armengol and Y. Zenou, Who’s who in networks. Wanted: the key player. Econometrica 74, 1403–1417 (2006)