Bounded-Compromise Theorem

• Bounded-Compromise Theorem is a central concept in game theory that defines efficiency bounds when agents balance their personal preferences with collective constraints, exemplified by linear Price of Anarchy limits.
• The theorem’s proofs use dual-based lower bounds, axiomatic uniqueness, and geometric as well as combinatorial arguments across opinion-formation, cooperative, and deliberative coalition games.
• Its applications span social network opinion dynamics, resource allocation, and deliberative decision-making while also outlining computational challenges and complexity limitations in decentralized negotiation.

The Bounded-Compromise Theorem refers to a core result appearing in several strands of game theory and collective decision models: it quantifies structural or inefficiency bounds that arise when agents must compromise between individual preferences and collective constraints, subject to “bounded” or local rules for consensus or payoff allocation. Prominent versions are found in non-cooperative opinion-formation games (“price of anarchy” bounds), cooperative game theory (unique solution values based on bounding allocations by lower and upper functionals), and deliberative coalition formation (sufficiency of pairwise compromise in continuous policy spaces). This article presents formal definitions, model contexts, and theorem statements for each of the three principal manifestations in the recent literature.

1. Bounded-Compromise in Opinion-Formation Games

The Bounded-Compromise Theorem in opinion-formation games, introduced by Caragiannis et al., provides upper bounds on the inefficiency of equilibrium in strategic models where agents express opinions as compromises between their internal beliefs and the expressed opinions of their $k$ nearest neighbors. The setting is as follows: $n$ agents, each with belief $s_i \in \R$, select expressed opinions $z_i\in\R$. Each agent $i$ “listens” to the $k$ agents whose opinions are closest to $s_i$. The individual cost is

$$\mathrm{cost}_i(z,s) = \max_{j\in N_i(z,s)}\left\{ |z_i-s_i|, |z_j-z_i| \right\},$$

and the social cost is $$\mathrm{SC}(z,s) = \sum_{i=1}^n \mathrm{cost}_i(z,s)$$.

A pure Nash equilibrium (PNE) is a vector $z$ such that no agent can reduce her cost by unilateral deviation. The efficiency loss is measured by the Price of Anarchy (PoA): $n$0 where $n$1 is the optimal state. The worst-case inefficiency is $n$2.

Main Theorem: For all $n$3,

$n$4

with $n$5 (tight). This expresses that for any neighborhood size $n$6, the efficiency loss due to bounded compromise grows at most linearly with $n$7; no sublinear bound is possible, as lower-bound examples exist with $n$8 for $n$9 and $s_i \in \R$0 (Caragiannis et al., 2017).

2. Bounded-Compromise in Cooperative Game Theory

The “Bounded-Compromise Theorem” in the context of transfer utility (TU) cooperative games unifies many classical compromise values (e.g., $s_i \in \R$1-value, Gately value) via an axiomatic characterization. Let $s_i \in \R$2 be the player set, and let $s_i \in \R$3 be the characteristic function. Consider a bound-pair $s_i \in \R$4, where $s_i \in \R$5 satisfy:

• $s_i \in \R$6 componentwise,
• Covariance: $s_i \in \R$7 is a game, $s_i \in \R$8, and $s_i \in \R$9.

A game $z_i\in\R$0 is $z_i\in\R$1-balanced if there exists an efficient allocation $z_i\in\R$2 with $z_i\in\R$3. The class $z_i\in\R$4 consists of all such games.

The unique compromise value $z_i\in\R$5 is: $z_i\in\R$6 for $z_i\in\R$7, and $z_i\in\R$8 otherwise.

Bounded-Compromise Theorem: The map $z_i\in\R$9 is the unique value satisfying:

• Minimal-rights: $i$0,
• Restricted proportionality: for $i$1 $i$2 for some $i$3.

Various classical values are special cases:

• $i$4, $i$5 marginal: PANSC value.
• $i$6 minimal-rights, $i$7 marginal: $i$8-value.
• On convex games, $i$9, $k$0, and $k$1 coincide. This construction demonstrates that efficient compromise between two natural benchmarks is always possible and unique, provided the bounds are non-self-contradictory (Gilles et al., 7 Mar 2025).

3. Bounded-Compromise in Deliberative Coalition Formation

Elkind, Ghosh, and Goldberg formalize compromise in coalition formation within $k$2-Euclidean policy spaces: agents and proposals are points in $k$3, with each agent approving proposals preferred to the status quo. The deliberation process consists of $k$4-compromise transitions, where up to $k$5 coalitions merge to form a new coalition supporting a proposal, possibly leaving behind non-approving agents.

A coalition structure is $k$6-terminal if no further $k$7-compromises are possible. The outcome is successful if some coalition achieves maximum possible support.

Bounded-Compromise Theorem: In every $k$8-Euclidean deliberation space, pairwise ($k$9) compromise suffices:

• Every $s_i$0-terminal coalition structure is already successful; maximal-support coalitions are achievable via sequences of $s_i$1-compromises from any initialization.
• Every $s_i$2-deliberation terminates in at most $s_i$3 transitions (where $s_i$4 is the number of agents).

The proof leverages the geometry of approval half-spaces in $s_i$5 and the potential function

$s_i$6

In the discrete hypercube model, exponentially large compromises may be required, in contrast to the Euclidean case (Elkind et al., 2022).

4. Proof Techniques and Complexity Considerations

Across these domains, proofs of bounded-compromise properties often rely on:

• Dual-based lower bounds: In opinion formation, LP duality establishes lower bounds on optimal social cost, which are then matched against geometric upper bounds at equilibrium (Caragiannis et al., 2017).
• Axiomatic uniqueness: In cooperative games, uniqueness is proved by reducing to proportionality (for null lower-bound), then showing any solution with the minimal-rights and restricted proportionality properties must coincide with the explicit compromise value (Gilles et al., 7 Mar 2025).
• Geometric and combinatorial arguments: In deliberative coalition formation, half-space geometry partitions agent approval zones; iterative two-coalition operations suffice for reaching maximal support by reducing a discrete potential function (Elkind et al., 2022).

Complexity limitations are prominent:

• For $s_i$7 in opinion-formation games, computing (best/worst) PNE is polynomial-time, but for $s_i$8 the problem's complexity is unresolved.
• In the deliberative coalition setting, the decision version (Euc-Score) and the decentralized process of finding a valid $s_i$9-compromise are NP-hard. The deliberation process may be exponentially long if adversarially ordered.

5. Significance and Applications

The Bounded-Compromise Theorem anchors a wide array of game-theoretic models by establishing that natural local or pairwise compromise rules—under reasonable structural or efficiency constraints—suffice to guarantee uniqueness and efficiency bounds or algorithmic reduction. In cooperative game theory, it unifies classical allocation rules through a common axiomatic lens, extending to assignment, network games, cost-sharing, and bargaining. In strategic formation and deliberation, it delivers precise quantification of the price of local negotiation or bounded coordination, illuminating both social-network dynamics and computational bottlenecks.

Applications include:

• Opinion-formation and polarization on social networks (Caragiannis et al., 2017),
• Resource and cost allocation in cooperative settings (Gilles et al., 7 Mar 2025),
• Protocols for distributed decision making, participatory budgeting, and other aggregative deliberative mechanisms (Elkind et al., 2022).

6. Generalizations, Limitations, and Open Questions

The Bounded-Compromise framework admits numerous generalizations:

• In non-cooperative opinion-formation, player-specific neighborhood sizes or alternative distance metrics (e.g., Hegselmann-Krause thresholds) are considered, though it is conjectured that linear inefficiency persists (Caragiannis et al., 2017).
• In cooperative games, allowing more general bound pairs or tightening axioms extends solution concepts beyond classical values (Gilles et al., 7 Mar 2025).
• In deliberation models, the tractability in higher-dimensional or discrete policy spaces and efficient decentralization procedures remain open, with the possibility of exponentially-sized compromises in the discrete domain (Elkind et al., 2022).

A plausible implication is that the essential principle—efficiency and uniqueness of outcomes arising from bounded or pairwise compromises—remains robust under a wide class of local negotiation and aggregation protocols. However, computational obstacles and domain-specific limitations (e.g., “curse of dimensionality”) delimit the full applicability in automated or large-scale systems.