Double Implementation under Partially Honest and Fully Strategic Agents in Minority Coalitions

<div> We study the double implementation of social choice correspondences (SCCs) under both Nash and M -Nash equilibria, where the latter accounts for deviations by minority coalitions of agents. We consider two behavioral assumptions: (i) a strict majority of agents exhibit partial honesty, or (ii) all agents behave fully strategically. Within this enriched framework, we characterize sufficient conditions for double implementation. Introducing the notion of partial honesty-a minimal ethical constraint on agent behavior-we show that weak Pareto dominance together with unanimity ensures double implementation. In the fully strategic setting, we establish that Y -monotonicity and unanimity are jointly sufficient, provided the number of agents is at least three. We illustrate the scope of our results through applications to coalitional games (strong core vs. weak core), matching markets (proper vs. improper sub-solutions of group stable matchings), and allotment economies under restricted preference domains-namely, single-peaked, single-plateaued, and single-dipped preferences. Our findings contribute to implementation theory by incorporating ethical refinement into strategic analysis, thereby enlarging the set of SCCs that are amenable to robust and behaviorally-informed mechanism design. </div>

Authors

Institutions

Publication Details

Journal
SPIRE - Sciences Po Institutional REpository
Published
2025-01-01
DOI
https://doi.org/10.13140/rg.2.2.14470.43841
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Double Implementation under Partially Honest and Fully Strategic Agents in Minority Coalitions

Abderrahmane Ziad, Badr Bahloul, Ahmed Doghmi
SPIRE - Sciences Po Institutional REpository
Game Theory and Voting Systems
article

Double Implementation under Partially Honest and Fully Strategic Agents in Minority Coalitions

Abderrahmane Ziad, Badr Bahloul, Ahmed Doghmi
article en

Abstract

<div> We study the double implementation of social choice correspondences (SCCs) under both Nash and M -Nash equilibria, where the latter accounts for deviations by minority coalitions of agents. We consider two behavioral assumptions: (i) a strict majority of agents exhibit partial honesty, or (ii) all agents behave fully strategically. Within this enriched framework, we characterize sufficient conditions for double implementation. Introducing the notion of partial honesty-a minimal ethical constraint on agent behavior-we show that weak Pareto dominance together with unanimity ensures double implementation. In the fully strategic setting, we establish that Y -monotonicity and unanimity are jointly sufficient, provided the number of agents is at least three. We illustrate the scope of our results through applications to coalitional games (strong core vs. weak core), matching markets (proper vs. improper sub-solutions of group stable matchings), and allotment economies under restricted preference domains-namely, single-peaked, single-plateaued, and single-dipped preferences. Our findings contribute to implementation theory by incorporating ethical refinement into strategic analysis, thereby enlarging the set of SCCs that are amenable to robust and behaviorally-informed mechanism design. </div>

SPIRE - Sciences Po Institutional REpository
Centre de Recherche en Économie et Management (FR), Université de Caen Normandie (FR)
Openalex Percentile: Top 65%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.