Glossary
Conflict Resolution Algorithms
Conflict Resolution Algorithms
Terms related to the formal mechanisms and decision-making processes agents use to reconcile competing goals or resource requests. Target: [Software Architects/Researchers].
Conflict Resolution Protocol
A conflict resolution protocol is a formalized set of rules and procedures that govern how autonomous agents detect, manage, and resolve conflicts arising from competing goals, resource requests, or inconsistent states.
Mediation Algorithm
A mediation algorithm is a decision-making process where a neutral third-party agent or process intervenes to facilitate a mutually acceptable agreement between conflicting agents by suggesting compromises or evaluating proposals.
Arbitration Mechanism
An arbitration mechanism is 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 utility functions.
Voting-Based Resolution
Voting-based resolution is a conflict resolution strategy where a group of agents collectively makes a decision by aggregating individual preferences or votes according to a specific electoral system.
Borda Count
Borda Count is a voting-based resolution method where agents rank alternatives, and points are assigned based on rank positions, with the alternative receiving the highest aggregate score being selected.
Condorcet Method
The Condorcet method is a voting-based resolution principle that selects the alternative which would win a pairwise majority vote against every other alternative, if such a Condorcet winner exists.
Approval Voting
Approval voting is a voting-based resolution system where each agent can vote for (approve) any number of alternatives, and the alternative with the most approval votes wins.
Instant-Runoff Voting (IRV)
Instant-Runoff Voting (IRV) is a ranked-choice voting method where agents rank alternatives, and the least-popular alternative is sequentially eliminated with its votes redistributed until a candidate achieves a majority.
Contract Net Protocol
The Contract Net Protocol is a negotiation and task allocation framework where a manager agent announces a task, contractor agents submit bids, and the manager awards the contract to the best bid.
Auction-Based Allocation
Auction-based allocation is a market-inspired conflict resolution mechanism where agents bid for resources or tasks, and allocation is determined by the auction's rules, such as highest bidder wins.
Vickrey Auction
A Vickrey auction is a sealed-bid auction mechanism where the highest bidder wins but pays the price of the second-highest bid, promoting truthful bidding as a dominant strategy.
Deadlock Detection
Deadlock detection is a conflict resolution process that identifies a circular wait condition where a set of agents are each holding resources and waiting for resources held by others, preventing progress.
Deadlock Prevention
Deadlock prevention is a proactive conflict resolution strategy that designs system constraints, such as resource ordering or request denials, to guarantee that the necessary conditions for a deadlock cannot occur.
Wait-Die Protocol
The Wait-Die protocol is a deadlock prevention scheme based on transaction timestamps, where an older transaction waits for a resource held by a younger one, but a younger transaction is aborted (dies) if it requests a resource held by an older one.
Wound-Wait Protocol
The Wound-Wait protocol is a deadlock prevention scheme where an older transaction preempts (wounds) a younger one holding a needed resource, forcing it to restart, while a younger transaction waits if the resource is held by an older transaction.
Banker's Algorithm
The Banker's Algorithm is a deadlock avoidance algorithm that simulates resource allocation to determine if granting a request would leave the system in a safe state where all agents could potentially complete.
Two-Phase Commit (2PC)
Two-Phase Commit (2PC) is a distributed consensus protocol that ensures atomicity across multiple agents by having a coordinator orchestrate a voting phase and a decision phase to commit or abort a transaction.
Consensus Algorithm
A consensus algorithm is a fault-tolerant distributed protocol that enables a group of agents to agree on a single data value or sequence of actions despite the failure of some participants.
Paxos
Paxos is a family of consensus algorithms for asynchronous networks that ensures a group of agents can agree on a single value even if some agents fail or messages are delayed.
Raft
Raft is a consensus algorithm designed for understandability, which elects a leader to manage log replication and ensure agreement across a distributed cluster of agents.
Byzantine Fault Tolerance (BFT)
Byzantine Fault Tolerance (BFT) is the property of a consensus system to reach agreement correctly even when some agents fail arbitrarily or behave maliciously, known as Byzantine failures.
Practical Byzantine Fault Tolerance (PBFT)
Practical Byzantine Fault Tolerance (PBFT) is a replication algorithm that allows a distributed system to tolerate Byzantine faults through a three-phase protocol involving a primary node and backups.
Nash Equilibrium
A Nash Equilibrium is a fundamental concept in game theory where, in a strategic interaction, no agent can unilaterally improve their outcome by changing strategy, given the strategies chosen by all other agents.
Pareto Optimality
Pareto optimality is a state of resource allocation where it is impossible to make any one agent better off without making at least one other agent worse off.
Gale-Shapley Algorithm
The Gale-Shapley algorithm is a stable matching algorithm that finds a pairwise stable solution for two sets of agents (e.g., residents and hospitals) where no unmatched pair would both prefer each other over their current matches.
Optimistic Concurrency Control (OCC)
Optimistic Concurrency Control (OCC) is a conflict resolution strategy where transactions proceed without locking, and conflicts are detected at commit time, requiring conflicting transactions to be rolled back and retried.
Pessimistic Concurrency Control
Pessimistic concurrency control is a conflict prevention strategy that uses locks to guarantee exclusive access to resources, preventing conflicts from occurring but potentially reducing system throughput.
Multi-Version Concurrency Control (MVCC)
Multi-Version Concurrency Control (MVCC) is a concurrency control method that allows multiple versions of a data item to coexist, enabling readers to access a consistent snapshot without blocking writers.
Conflict-Free Replicated Data Type (CRDT)
A Conflict-Free Replicated Data Type (CRDT) is a data structure designed for distributed systems that can be replicated across agents and updated concurrently without coordination, guaranteeing eventual consistency.
Operational Transformation (OT)
Operational Transformation (OT) is an algorithm used in collaborative editing systems to resolve conflicts by transforming concurrent operations (like insert and delete) to achieve a consistent final state across all replicas.
Semaphore
A semaphore is a synchronization primitive used in concurrent programming to control access to a common resource by multiple agents, using a counter to manage permits for entry into a critical section.
Mutex
A mutex (mutual exclusion) is a synchronization object that ensures only one agent can execute a critical section of code or access a shared resource at any given time.
Vector Clock
A vector clock is a logical timestamp mechanism used in distributed systems to capture causal relationships between events, enabling the detection of concurrent updates and conflict resolution.
Round-Robin Scheduling
Round-robin scheduling is a fairness algorithm that allocates a resource, such as CPU time, to each agent in a cyclic order for a fixed time slice, ensuring no agent is starved.
Earliest Deadline First (EDF)
Earliest Deadline First (EDF) is a dynamic priority, preemptive scheduling algorithm that selects the agent with the closest deadline for execution, optimizing for meeting time constraints.
Rate Monotonic Scheduling (RMS)
Rate Monotonic Scheduling (RMS) is a static priority, preemptive scheduling algorithm that assigns higher priority to agents with shorter periods, providing a schedulability guarantee for periodic tasks.
CAP Theorem
The CAP theorem is a fundamental principle in distributed systems stating that a networked shared-data system can provide only two out of three guarantees: Consistency, Availability, and Partition tolerance.
ACID Properties
ACID properties (Atomicity, Consistency, Isolation, Durability) are a set of guarantees that ensure reliable processing of database transactions, even in the event of errors or system failures.
Saga Pattern
The Saga pattern is a failure management pattern for long-running transactions that breaks the transaction into a sequence of local transactions, each with a compensating transaction to undo its effects if a later step fails.
Exactly-Once Semantics
Exactly-once semantics is a guarantee in message processing that each agent's action or message delivery will be processed precisely one time, despite potential system failures or retries.
Multi-Agent Reinforcement Learning (MARL)
Multi-Agent Reinforcement Learning (MARL) is a subfield of machine learning where multiple agents learn to make decisions by interacting with a shared environment and each other, often requiring specialized algorithms for stability and convergence.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us