📈 economics

Single-Peaked Domain Augmented with Complete Indifference: A Characterization of Target Rules with a Default

This paper characterizes the class of target rules with a default for public decision problems on an augmented single-peaked domain—where agents may be completely indifferent—by proving that onto-ness and pairwise strategy-proofness uniquely identify these rules.

Original authors: Parikshit De, Abinash Panda, Anup Pramanik

Published 2026-03-19

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Parikshit De, Abinash Panda, Anup Pramanik

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: Choosing a Pizza Topping (or a Park Bench)

Imagine a group of friends trying to decide where to build a new park bench along a long, straight path. The path goes from 0 (the start) to 1 (the end).

The "Normal" Friends: Most people have a favorite spot. Maybe Alice loves the spot at 0.3, and Bob loves 0.8. They like spots closer to their favorite more than spots further away. In economics, this is called Single-Peaked Preferences. It's like a mountain: you climb up to your peak (your favorite spot) and slide down the other side.
The "Indifferent" Friends: Then, there are people like Charlie. Charlie doesn't care where the bench goes. He thinks, "Honestly, I'd rather not be here at all," or "I'm just going to sit on my phone." He is completely indifferent. In the real world, this is like someone voting "None of the Above" (NOTA) or simply abstaining because they have no strong opinion.

The Problem: How do you make a fair rule to pick a spot on the path that:

Respects the people who care (the "peaked" friends).
Doesn't let people lie about their preferences to get a better result (Strategy-Proofness).
Can actually pick any spot on the path if the group wants to (Onto-ness).

The "Cheat Code": What the Paper Found

The authors, Parikshit De, Abinash Panda, and Anup Pramanik, discovered a specific type of rule that solves this puzzle perfectly. They call it a "Target Rule with a Default."

Think of it like a GPS Navigation System with a pre-set destination.

How the Rule Works (The GPS Analogy)

Imagine the group agrees on two things before they start voting:

The Target (x): A specific "ideal" spot on the path (e.g., the middle, 0.5).
The Default (y): A backup spot if nobody cares (e.g., the start, 0).

Here is how the GPS decides where to go based on who is in the car:

Scenario A: The "Ideal" Spot is Available.
If the group has at least one person who cares, and the "Target" (0.5) is a reasonable spot for them (meaning it's between the leftmost and rightmost person's favorite spot), the GPS locks onto the Target.
- Metaphor: Even if Alice wants 0.3 and Bob wants 0.8, if the Target is 0.5, the group goes to 0.5. It's a compromise that everyone can live with.
Scenario B: The "Ideal" Spot is Too Far.
If the Target is outside the range of what the group wants (e.g., the Target is 0.9, but everyone wants something between 0.1 and 0.4), the GPS snaps to the closest person's peak.
- Metaphor: If the Target is way off the map, the system just picks the person whose favorite spot is closest to the Target. It's like saying, "Okay, we can't go to the Target, so let's go to the closest person's house."
Scenario C: The "Silent" Room.
If everyone is indifferent (everyone is Charlie), the GPS ignores the Target and goes straight to the Default spot.
- Metaphor: If nobody cares, we just pick the pre-agreed backup plan.

The Magic Ingredient: "Pairwise Strategy-Proofness"

The paper proves that this specific GPS rule is the only rule that works if you have a specific safety net.

Usually, we worry about people lying. "I actually hate 0.5, I love 0.9!" they might shout, hoping to trick the system.

Group Strategy-Proofness says: "No group of any size can lie together to cheat." This is very hard to prove and very strict.
Pairwise Strategy-Proofness (The paper's focus) says: "No pair of friends can team up to lie and cheat."

Why is this important?
The authors found that you don't need to worry about a massive conspiracy of 10 people lying. You only need to make sure that two people can't collude to trick the system. If you prevent pairs from cheating, you automatically prevent the whole group from cheating in this specific setup.

It's like a security system: If you make it impossible for two people to pick the lock together, you don't need to worry about a whole gang of thieves. It's a simpler, more realistic way to ensure honesty.

The "Gotcha": Why You Need at Least 3 People

The paper has a funny little warning in Remark 3.

If you have 3 or more people, this "Target Rule" is the only solution that works.
If you only have 2 people, the rules break down. With just two people, you can invent weird rules that aren't "Target Rules" but still work.
- Analogy: With three friends, the "middle ground" logic holds up. With two friends, it's just a tug-of-war, and you can rig the game in ways that don't fit the neat "Target" pattern.

Summary: The Takeaway

The World: We have people with strong opinions and people who don't care (abstainers).
The Goal: We want a fair way to pick a public decision (like a tax rate or a park location) that no one can cheat.
The Solution: Use a Target Rule with a Default.
- Pick a "Target" and a "Default."
- If the Target is fair, pick it.
- If the Target is unfair, pick the closest person's favorite.
- If no one cares, pick the Default.
The Guarantee: As long as you have at least 3 people, this is the only way to ensure that no two people can team up to lie and get a better result.

In a nutshell: The paper shows that when designing a voting system for a mix of passionate voters and indifferent bystanders, the best strategy is to have a "Plan B" (the default) and a "Plan A" (the target), and let the math decide which one to use so that no one can game the system.

1. Problem Statement

The paper addresses a public decision problem where a finite society of $n$ agents ( $n \geq 2$ ) must select a level of a public good from a closed interval $A = [0, 1]$ . The core innovation lies in the preference domain:

Standard Agents: Agents possess single-peaked preferences (strictly preferring alternatives closer to a unique peak $\tau(R_i)$ ).
Indifferent Agents: Agents may be completely indifferent over the entire interval (denoted as $R_0$ ).
Interpretation: Completely indifferent agents represent abstention or a "None of the Above" (NOTA) stance, where agents participate in the process but refuse to endorse any specific outcome.

The authors seek to characterize the class of Social Choice Functions (SCFs) that are robust to strategic manipulation on this augmented domain ( $S_0 = S \cup \{R_0\}$ ).

2. Methodology and Axioms

The authors employ an axiomatic approach, utilizing the following properties to characterize the rules:

Onto-ness (Surjectivity): Every feasible alternative in $A$ must be the outcome for at least one preference profile. This is a weaker condition than efficiency.
Pairwise Strategy-Proofness (PSP): No coalition of size at most two can jointly misreport preferences to make all members weakly better off and at least one strictly better off.
- Significance: This is a tractable weakening of Group Strategy-Proofness (GSP). While GSP prevents manipulation by coalitions of any size, PSP restricts attention to pairs, avoiding combinatorial complexity while remaining behaviorally plausible (as coordination is easier for two agents than large groups).
Efficiency (Pareto Optimality): The chosen outcome must not be Pareto dominated. On this domain, for any profile with at least one single-peaked agent, the set of efficient outcomes is the interval $[\underline{\tau}(R), \overline{\tau}(R)]$ , where $\underline{\tau}$ and $\overline{\tau}$ are the minimum and maximum peaks among non-indifferent agents.
Tops-Only Property: The outcome depends only on the set of indifferent agents and the peaks of the single-peaked agents, ignoring the specific shape of preferences away from the peak.

3. Key Contributions and Results

A. The Characterization Theorem (Theorem 1)

The main result states that for $n \geq 3$ , a social choice function is onto and pairwise strategy-proof if and only if it is a Target Rule with a Default.

Definition of Target Rule with a Default:
A rule $f$ is defined by a target level $x \in A$ and a default level $y \in A$ . For any profile $R$ :

If all agents are indifferent ( $R = R_0^N$ ): The rule selects the default level $y$ .
If at least one agent is single-peaked ( $R \neq R_0^N$ ):
- If the target $x$ lies within the efficient interval $[\underline{\tau}(R), \overline{\tau}(R)]$ , the rule selects $x$ .
- If $x < \underline{\tau}(R)$ , the rule selects the lowest peak $\underline{\tau}(R)$ .
- If $x > \overline{\tau}(R)$ , the rule selects the highest peak $\overline{\tau}(R)$ .

B. Implications and Derivations

Emergence of Efficiency and Tops-Only: Crucially, the authors show that Efficiency and the Tops-Only property are not assumed but are derived consequences of Onto-ness and Pairwise Strategy-Proofness.
Group Strategy-Proofness: The paper proves (Lemma 2) that Target Rules with a Default are actually Group Strategy-Proof (resistant to manipulation by coalitions of any size), implying that the weaker PSP axiom is sufficient to characterize the full class of GSP rules in this context.
Anonymity: The resulting rules are anonymous; the outcome depends on preferences, not agent identities.

C. The Case of $n=2$

The characterization fails for $n=2$ . The authors provide a counter-example (Remark 3) of a rule that is onto and pairwise strategy-proof but is not a target rule with a default. This highlights the necessity of having at least three agents for the characterization to hold.

D. Failure under Weaker Constraints (Section 4)

The paper investigates what happens if PSP is weakened to individual Strategy-Proofness or Weak Group Strategy-Proofness (where a coalition must make all members strictly better off).

Result: Under these weaker constraints, rules can be onto and strategy-proof but fail to be Efficient or Tops-Only.
Example: A rule that selects the peak of agent 1 if they are not indifferent, but defaults to 0 or 1 based on agent 2's strict preference ordering (even if agent 2 is indifferent in terms of peaks), demonstrates that without the stronger PSP constraint, the "tops-only" structure collapses.

4. Significance and Relation to Literature

Incentive-Based vs. Solidarity-Based: Previous literature (e.g., Thomson, Ching) characterized similar "target rules" on the standard single-peaked domain using solidarity axioms (e.g., replacement domination, population monotonicity). This paper provides a purely incentive-based foundation (PSP + Onto-ness) that does not rely on solidarity principles.
Handling Indifference: The paper extends the classical Moulin (1980) framework to accommodate complete indifference. It demonstrates that while standard single-peaked domains often equate strategy-proofness with tops-onlyness, the augmented domain requires stronger incentive constraints (PSP) to recover the same structural properties.
Robustness: By showing that PSP implies GSP for this specific class of rules, the paper establishes that these rules are highly robust against strategic manipulation, even when considering larger coalitions.
Practical Application: The "Default" mechanism offers a formal solution for handling abstention in public goods provision, ensuring a decision is made even when all participants are indifferent, without compromising strategy-proofness.

Conclusion

The paper successfully characterizes a specific class of social choice rules (Target Rules with a Default) as the unique solution to a public decision problem involving single-peaked and completely indifferent agents. By utilizing Onto-ness and Pairwise Strategy-Proofness, the authors derive efficiency, the tops-only property, and anonymity as natural consequences, offering a rigorous incentive-compatible framework for public decision-making with abstention.