The undercut procedure: an algorithm for the envy-free division of indivisible items (Q2450092): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2156641215 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5444155 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4338900 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4700639 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fair division of indivisible items between two players: design parameters for contested pile methods / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:19, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The undercut procedure: an algorithm for the envy-free division of indivisible items |
scientific article |
Statements
The undercut procedure: an algorithm for the envy-free division of indivisible items (English)
0 references
16 May 2014
0 references
