Approval Voting

A broad category of conflict resolution strategies where a group of agents collectively makes a decision by aggregating individual preferences or votes according to a specific electoral system. Unlike negotiation, it is a non-discursive method.

• Key Principle: Aggregates preferences to find a group choice.
• Common Systems: Include plurality, majority, and ranked-choice methods.
• Agent Context: Used when agents have equal stake and a discrete set of alternatives, such as selecting a plan from a shortlist or choosing a leader in a decentralized network.

A ranked-choice voting method where agents submit a complete preference ordering of all alternatives. Points are assigned based on rank position (e.g., first place gets n points, second gets n-1), and the alternative with the highest aggregate score wins.

• Contrast with Approval Voting: Requires a full ranking, not a simple approve/deny. Captures intensity of preference.
• Strategic Vulnerability: Susceptible to tactical voting, such as burying a strong competitor by ranking it last.
• Use Case: Suitable for agent systems where nuanced preference expression is possible and a consensus winner is valued over a simple majority.

A family of voting systems that elects the Condorcet winner—the alternative that would defeat every other alternative in a head-to-head pairwise majority vote. If no such winner exists, a Condorcet completion method (like Ranked Pairs or Schulze) is used.

• Core Principle: Reflects majority preference in all one-on-one comparisons.
• Computational Complexity: Requires O(n²) pairwise comparisons, which is trivial for AI agents.
• Agent Application: Ideal for agent collectives where majority dominance is a critical fairness criterion, ensuring the selected option is robust against direct challenges.

A single-winner, ranked-choice electoral system where agents rank alternatives. The least-popular alternative (with the fewest first-choice votes) is sequentially eliminated, and its votes are redistributed based on next preferences until one alternative achieves a majority.

• Process: Iterative elimination and redistribution of votes.
• Goal: Ensures the winner has broad support, not just a plurality.
• Multi-Agent Context: Useful for agent committees making a single selection (e.g., choosing a coordinator) where building a consensus majority is more important than speed.

A conflict resolution method where a designated authority or algorithm makes a binding decision for conflicting agents based on a predefined set of rules or a utility function. It is a centralized, authoritative approach.

• Key Difference from Voting: Imposes a solution rather than aggregating preferences. The arbitrator's logic is the resolution function.
• Types: Can be automatic (rule-based algorithm) or mediative (an agent evaluating proposals).
• System Use: Common in orchestration layers where a central controller must resolve deadlocks or priority disputes efficiently and definitively.

A foundational concept in game theory describing a stable state in a strategic interaction between multiple agents. In a Nash Equilibrium, no agent can unilaterally improve their outcome by changing their strategy, given the strategies chosen by all other agents.

• Relation to Conflict Resolution: Describes a potential endpoint of a negotiation or competitive interaction where conflicts are implicitly resolved through stable strategies.
• Computational Challenge: Finding a Nash Equilibrium is often computationally complex (PPAD-hard).
• Agent Design: Used to analyze and predict the stable outcomes of multi-agent interactions, informing the design of incentive-compatible mechanisms.