Rabin fairness model
E1305605
UNEXPLORED
The Rabin fairness model is a behavioral economics framework that incorporates social preferences and fairness concerns into game-theoretic analysis of decision-making.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Rabin fairness model canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T18100667 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rabin fairness model Context triple: [Matthew Rabin, notableWork, Rabin fairness model]
-
A.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
-
B.
FLP impossibility result
The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
-
C.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
D.
Jain’s fairness index
Jain’s fairness index is a widely used quantitative metric in networking and resource allocation that measures how evenly resources are shared among multiple users or flows.
-
E.
"Time, Clocks, and the Ordering of Events in a Distributed System"
"Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Rabin fairness model Target entity description: The Rabin fairness model is a behavioral economics framework that incorporates social preferences and fairness concerns into game-theoretic analysis of decision-making.
-
A.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
-
B.
FLP impossibility result
The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
-
C.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
D.
Jain’s fairness index
Jain’s fairness index is a widely used quantitative metric in networking and resource allocation that measures how evenly resources are shared among multiple users or flows.
-
E.
"Time, Clocks, and the Ordering of Events in a Distributed System"
"Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.