d4-conf-wine-2019-0028

The strongest positive case in the supplied set is “Information Design in Spatial Resource Competition.” I would mirror its private persuasion problem, and keep the claim narrow: a large cohort of agents with a small number of shared moving-cost types faces congestion when moving to a resource-rich location.

The anchor is Theorem 1, proved in the paper. In its finite model, \(N\) agents choose whether to move; the resource state is \(\theta\in\{0,1\}\), and moving costs \(r(i)\) are known. An agent who moves when \(k\) agents move gets \(\theta F(k)-r(i)\), while total welfare is \(\theta kF(k)-\sum_{i\text{ moves}}r(i)\). The theorem says an optimal private signaling mechanism can be computed by solving LP.2 and then sampling a set of agents according to Algorithm 1. LP.2 uses \(N^2\) variables \(p_{ik}\), where \(p_{ik}\) is the probability, conditional on \(\theta=1\), that agent \(i\) is recommended to move and exactly \(k\) agents are recommended to move. Its objective is to maximize \(\sum_{i,k}p_{ik}(F(k)-r(i))\); its constraints enforce each agent’s move and stay incentives, a valid distribution over mover counts, and valid inclusion marginals for choosing \(k\) agents. It has \(N^2+2N+1\) constraints and can be solved in polynomial time. The sampling step first draws the number \(k\) of movers, then samples a \(k\)-person set with the prescribed inclusion probabilities. The paper proves the result using its LP reformulation and a sequential sampling procedure. [Theorem 1 and its proof](https://arxiv.org/pdf/1909.12723)

Here is a continuous problem that preserves that question. Take \(\tau\) types with rational masses \(\mu_t>0\), \(\sum_t\mu_t=1\), and moving costs \(r_t\). Members of a type share all attributes relevant to the model. Let \(\theta\in\{0,1\}\) have rational prior \(\pi_\theta\), and use the per-capita resource function \(f(z)=A/(B+z)\), for positive rationals \(A,B\). This is decreasing and convex, while \(zf(z)\) is increasing and concave, matching the paper’s congestion assumptions. A mass \(x_t\in[0,\mu_t]\) of each type receives a move recommendation; write \(z=\sum_t x_t\). The sender observes \(\theta\), then privately recommends moves to those masses and stay to everyone else.

Call this Continuum Private Persuasion for Congested Migration. The instance is \((\mu_t,r_t)_{t=1}^{\tau}\), the prior \((\pi_0,\pi_1)\), and \(A,B\). A signaling scheme is a pair of probability distributions \(\kappa_\theta\) over feasible mass vectors \(x\), one for each observed state. Given \(x\), the mechanism selects the recommended movers exchangeably within each type. The scheme must satisfy, for every type \(t\), the move and stay obedience constraints
\[ \sum_{\theta\in\{0,1\}}\pi_\theta\int x_t\bigl(\theta f(z)-r_t\bigr)\,d\kappa_\theta(x)\geq 0,\qquad \sum_{\theta\in\{0,1\}}\pi_\theta\int (\mu_t-x_t)\bigl(\theta f(z)-r_t\bigr)\,d\kappa_\theta(x)\leq 0. \]
Among schemes satisfying these constraints, maximize expected per-capita welfare
\[ \sum_{\theta\in\{0,1\}}\pi_\theta\int\left(\theta zf(z)-\sum_t r_tx_t\right)d\kappa_\theta(x). \]
A solution is an optimal pair of kernels, together with the exchangeable rule that implements each mass allocation through private recommendations.

The regime is a large driver cohort in one origin area considering a nearby hotspot. A type records the cohort’s complete relevant description, including its moving cost and resource response. For example, fixed shift and operating-cost arrangements could yield many drivers but relatively few distinct types. The proportions \(\mu_t\) describe the population; the recommendation is to a mass of each type, not a list of named drivers. The paper already studies the right interaction—private information, strategic responses, and congestion through the number of movers. The continuation replaces that count with a fraction and makes per-capita supply explicit. It does not turn the outcome into the continuous object.

I expect this mirror to be Class A, tractable. The scheme optimization is a linear program over measures with finitely many obedience moments. Its dual pricing problem optimizes a linear combination of terms such as \(zf(z)\), \(x_tf(z)\), and \(x_t\). For fixed \(z\), choosing the masses \(x_t\) is a fractional allocation problem over \(\tau\) types. With \(f(z)=A/(B+z)\), the type rankings can change only at finitely many crossings, leaving a one-dimensional optimization on each interval. That gives a concrete route to a separation algorithm and then to column generation or ellipsoid methods. This is a proposed tractability path, not a result of the paper. It could lead to a polynomial algorithm in \(\tau\) and the rational input size. Further questions include whether the finite-agent optimum converges to this one at a controlled rate, whether the result extends to more general resource functions, and what happens with public signals or multiple destinations.

The soft spot is that a nonatomic agent’s unilateral move does not change \(z\), whereas in the finite game it changes the mover count and therefore the agent’s payoff. The mirror takes the natural large-population scaling \(F_N(k)=f(k/N)\), under which that individual effect vanishes while the aggregate congestion effect remains. That is a real change to the strategic model, though one the authors could recognize as its mean-field version. Also, this paper offers an algorithmic anchor rather than a hardness result, so this case opens a continuous optimization question but does not test whether discrete hardness dissolves.