Principle of Minimum Dissatisfaction

• PMD is a framework in resource allocation and mechanism design that minimizes the overall dissatisfaction of agents using ordinal and probabilistic preference representations.
• It quantifies dissatisfaction based on non-dominated items within structured preference graphs, leading to objective functions like Min-Sum-Diss and Min-Max-Diss with precise optimality bounds.
• Algorithmic techniques such as graph decomposition, matching, and dynamic programming yield efficient solutions on restricted domains, despite NP-hardness for k ≥ 3 in general cases.

The Principle of Minimum Dissatisfaction (PMD) is a unifying concept in resource allocation, mechanism design, and joint decision theory, prescribing that outcomes be selected to minimize a quantified aggregate of dissatisfaction across agents. In its various instantiations, the PMD framework replaces explicit cardinal utilities with combinatorial, ordinal, or probabilistic representations of agent preferences and defines dissatisfaction via context-specific loss or regret measures. Recent research delivers foundational complexity dichotomies, algorithmic mechanisms, and analytical results for a range of allocation and choice problems grounded in the PMD paradigm.

1. Formal Foundations and Core Definitions

Formulations of the PMD typically involve a set of $k$ agents and a finite ground set $V$ of indivisible items or alternatives. Agents’ preferences are represented without recourse to individual numerical valuation vectors, but instead via global structures such as a directed acyclic preference graph $G = (V, A)$, or, in stochastic joint choice models, via probability vectors over possible choices.

Common Preference Graph:

Let $G=(V,A)$ be a DAG whose nodes $V$ denote $n$ items and arcs $A$ encode strict common preferences: $(a, b) \in A$ means all agents prefer $a$ to $b$. The relation $V$0 is defined if there exists a directed path from $V$1 to $V$2. The sets $V$3, $V$4, $V$5, and $V$6 denote, respectively, predecessors, successors, and their closed variants in $V$7.

Allocation and Dissatisfaction:

An allocation $V$8 maps agents to disjoint item subsets. Each agent’s dissatisfaction $V$9 is the number of items the agent does not receive and which are not dominated by any item they do receive:

$G = (V, A)$0

The total dissatisfaction (social cost) is then:

$G = (V, A)$1

Optimal PMD solutions minimize $G = (V, A)$2, either in total (utilitarian) or maximum (egalitarian) forms (Chiarelli et al., 2024, Chiarelli et al., 2023).

Stochastic and Mechanism-Design Generalizations:

In project-choice and stochastic joint decision problems, PMD equates to minimizing the designer’s worst-case regret or the aggregate squared deviation between probabilistic marginal preferences and realized allocations (Guo et al., 2023, Shinkawa et al., 2022). For probability vectors $G = (V, A)$3, the loss is

$G = (V, A)$4

where $G = (V, A)$5 is a conflict-free joint probability matrix.

2. PMD in Item Allocation and Graphical Preference Structures

The seminal PMD problem, as formulated in (Chiarelli et al., 2024), formalizes efficient allocation under a common preference graph with the objective of minimizing summed dissatisfaction. The model makes no assumption of cardinal utility; instead, dissatisfaction is induced topologically. For each agent, any item not “dominated” by a received item contributes 1 to their dissatisfaction.

Objective Functions

• Min-Sum-Diss: $G = (V, A)$6—allocation minimizing total dissatisfaction.
• Min-Max-Diss: $G = (V, A)$7—allocation minimizing worst dissatisfaction (Chiarelli et al., 2023).

Structural Results

• For two agents ($G = (V, A)$8), PMD admits linear-time solutions on general DAGs, using source partitioning strategies.
• When $G = (V, A)$9, PMD is NP-complete even for highly restricted DAG classes (e.g., one-way bipartite graphs of height 2, in-degree $G=(V,A)$0), by reduction from $G=(V,A)$1-colorability.
• For special classes (polytrees, series-parallel graphs, cactus graphs, width-2 DAGs), polynomial or linear-time algorithms exist, leveraging graph decomposition and matching techniques.

Optimality Bounds:

A lower bound for total dissatisfaction is provided by

$G=(V,A)$2

Optimal allocations (“good allocations”) achieve equality (Chiarelli et al., 2024).

3. Algorithmic Techniques and Complexity Dichotomies

PMD’s algorithmic landscape is determined both by the agent count and the structure of the preference graph.

Graph Structure	$G=(V,A)$3 Complexity	$G=(V,A)$4 Complexity	Techniques
General DAG	Linear	NP-complete	Source partition, reduction
Polytrees/Forests	Linear	Polytime/XP in $G=(V,A)$5	Queue method, DP
Width-2 DAGs	Polytime	Polytime	Bipartite min-weight matching
Series-Parallel	Polytime	Polytime	Recursive decomposition

In egalitarian settings, (Chiarelli et al., 2023) introduces bottleneck matching for width-2 graphs, greedy exchange for out-stars, and dynamic programming for tree structures. Parameterized fixed-parameter tractable (FPT) algorithms exist when structural modularity is exploited, e.g., FPT in $G=(V,A)$6 where $G=(V,A)$7 is the count of modules of path or independent set type. Integer linear programming formulations solve pure independent-set module cases in FPT($G=(V,A)$8) time.

4. PMD in Stochastic and Mechanism Design Contexts

In decision design and mechanism theory, PMD coincides with minimax-regret methodology.

Project/Choice Environments (Guo et al., 2023):

• Regret of choice rule $G=(V,A)$9 at set $V$0 is $V$1.
• PMD prescribes selecting $V$2 to minimize the worst-case regret over all $V$3:

$V$4

• Mechanism design distinguishes environments by proposal constraints (single-project vs. multiproject)—multiproject regimes yield strictly lower worst-case regret, as richer proposals allow for improved fallback allocations and more efficient agent payoffs.

Conflict-Free Joint Decisions (Shinkawa et al., 2022):

• Each agent’s preferences are probabilistic; joint allocations must avoid conflicts.
• Loss $V$5 (total squared deviation from target marginals) is minimized over conflict-free choices.
• If for all $V$6, $V$7, zero-loss allocations are possible; otherwise the minimum achievable loss $V$8 admits an explicit KKT-derived formula.

5. Theoretical Guarantees and Proof Sketches

PMD solutions are underpinned by tight complexity dichotomies and explicit optimality criteria:

• NP-Hardness: For $V$9, PMD is computationally intractable even for height-2 preference DAGs (Chiarelli et al., 2024, Chiarelli et al., 2023).
• Polynomial Cases: For $n$0 or when the underlying preference structure admits sufficient decomposability (out-forest, width 2, series-parallel), the problem is tractable.
• Matching Decompositions: For width-2 DAGs, allocations reduce to matching problems in bipartite graphs; for series-parallel and cactus graphs, recursive composition of “good allocations” maintains optimality.
• Mechanism Tightness: In minimax-regret principal-agent screening, two-tier approval rules are provably minimax-optimal in the single-project case, and PMP mechanisms are optimal in the multiproject setting by LP construction (Guo et al., 2023).

6. Generalizations, Related Models, and Extensions

The PMD concept extends classical fair division and social choice theory by handling both deterministic and stochastic preference frameworks under indivisibility and conflict-avoidance constraints.

• Connection to Top Trading Cycle: PMD generalizes deterministic allocation mechanisms to settings with probabilistic preferences and indivisibilities (Shinkawa et al., 2022).
• Egalitarian vs. Utilitarian Objectives: Papers such as (Chiarelli et al., 2023) distinguish minimizing aggregate versus maximum dissatisfaction, with matching dichotomies in complexity and solution method.
• Fixed-Parameter Tractability: Modular decomposition (path and independent set modules) enables FPT algorithms under reasonable graph-theoretic restrictions.

7. Significance and Ongoing Directions

The PMD principle formalizes a shift from optimizing cardinal utility to minimizing aggregate dissatisfaction under combinatorial, ordinal, or stochastic preference input. Its landscape reveals significant interplay between preference structure, agent count, and algorithmic feasibility. PMD-based analyses yield closed-form guarantees, efficient algorithms on restricted domains, and tight connections to established mechanism, decision, and matching theories.

Recent work continues to refine PMD approaches, with advancements in characterization of tractable subdomains, the derivation of Pareto-efficient conflict-free mechanisms in stochastic or information-asymmetric settings, and further exploration of modular graph-theoretic decompositions.

---

Key references:

• "Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction" (Chiarelli et al., 2024)
• "Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph" (Chiarelli et al., 2023)
• "Regret-Minimizing Project Choice" (Guo et al., 2023)
• "Optimal preference satisfaction for conflict-free joint decisions" (Shinkawa et al., 2022)