Triple
T21580451
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | game theory |
E532507
|
entity |
| Predicate | hasConcept |
P531
|
FINISHED |
| Object |
Shapley value
The Shapley value is a solution concept in cooperative game theory that fairly allocates the total gains of cooperation among players based on their average marginal contributions across all possible coalitions.
|
E1491264
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Shapley value | Statement: [game theory, hasConcept, Shapley value]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shapley value Context triple: [game theory, hasConcept, Shapley value]
-
A.
Kalai–Smorodinsky bargaining solution
The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
-
B.
Nash bargaining solution
The Nash bargaining solution is a foundational concept in game theory that defines a fair and efficient outcome for two-party bargaining problems based on axioms of rationality and symmetry.
-
C.
Nash equilibrium
A Nash equilibrium is a game-theoretic solution concept where no player can improve their payoff by unilaterally changing their strategy, given the strategies of all other players.
-
D.
Choquet game
The Choquet game is a topological infinite game between two players whose winning strategies characterize important properties of spaces, such as being a Choquet or Baire space.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Shapley value Triple: [game theory, hasConcept, Shapley value]
Generated description
The Shapley value is a solution concept in cooperative game theory that fairly allocates the total gains of cooperation among players based on their average marginal contributions across all possible coalitions.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Shapley value Target entity description: The Shapley value is a solution concept in cooperative game theory that fairly allocates the total gains of cooperation among players based on their average marginal contributions across all possible coalitions.
-
A.
Kalai–Smorodinsky bargaining solution
The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
-
B.
Nash bargaining solution
The Nash bargaining solution is a foundational concept in game theory that defines a fair and efficient outcome for two-party bargaining problems based on axioms of rationality and symmetry.
-
C.
Nash equilibrium
A Nash equilibrium is a game-theoretic solution concept where no player can improve their payoff by unilaterally changing their strategy, given the strategies of all other players.
-
D.
Choquet game
The Choquet game is a topological infinite game between two players whose winning strategies characterize important properties of spaces, such as being a Choquet or Baire space.
-
E.
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.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69e0c4618bec8190bcb0feb74568cbb1 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69eeeb5c496c819093113dd5790fca48 |
completed | April 27, 2026, 4:51 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a09f67889bc81908d640cbe0bc4b121 |
completed | May 17, 2026, 5:10 p.m. |
| NEDg | Description generation | batch_6a09f70d94308190b1c8f11e0a93b883 |
completed | May 17, 2026, 5:12 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a09f7f91058819081d7230042ec080c |
completed | May 17, 2026, 5:16 p.m. |
Created at: April 16, 2026, 6:31 p.m.