Undercut procedure
The undercut procedure is a procedure for fair item assignment between two people. It provably finds a complete envy-free item assignment whenever such assignment exists. It was presented by Brams and Kilgour and Klamler and simplified and extended by Aziz.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
Undercut procedure
The undercut procedure is a procedure for fair item assignment between two people. It provably finds a complete envy-free item assignment whenever such assignment exists. It was presented by Brams and Kilgour and Klamler and simplified and extended by Aziz.
has abstract
The undercut procedure is a pr ...... mplified and extended by Aziz.
@en
Wikipage page ID
52,090,026
page length (characters) of wiki page
Wikipage revision ID
1,005,985,354
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
The undercut procedure is a pr ...... mplified and extended by Aziz.
@en
label
Undercut procedure
@en