Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
fair division algorithm
|
| gptkbp:appliesTo |
cake-cutting problem
|
| gptkbp:complexity |
finite steps
|
| gptkbp:designedFor |
dividing a divisible good among three people
|
| gptkbp:field |
gptkb:mathematics
economics game theory |
| gptkbp:guarantees |
envy-free allocation
|
| https://www.w3.org/2000/01/rdf-schema#label |
Selfridge–Conway procedure
|
| gptkbp:introducedIn |
1979
|
| gptkbp:namedAfter |
gptkb:John_Horton_Conway
gptkb:John_Selfridge |
| gptkbp:notableFor |
first known envy-free procedure for three people
|
| gptkbp:participants |
3
|
| gptkbp:property |
envy-free
finite procedure |
| gptkbp:relatedTo |
fair division
Brams–Taylor procedure Steinhaus cake-cutting problem |
| gptkbp:usedIn |
mathematical economics
algorithmic game theory |
| gptkbp:bfsParent |
gptkb:John_Selfridge
|
| gptkbp:bfsLayer |
6
|