A restriction involving two variables in a constraint satisfaction problem, represented by the allowed value pairs . Multiple restrictions on the same pair can be combined by intersection. For bundle allocation, disjointness and the two directional envy-free allocation inequalities together define one compatibility relation.
Articles by others on the same topic
A binary constraint is a type of constraint that involves exactly two variables in a constraint satisfaction problem (CSP). In the context of CSPs, constraints are rules or conditions that restrict the values that variables can simultaneously take. Binary constraints specify the relationships between pairs of variables and define which combinations of variable values are acceptable.