Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bidding for envy-freeness: a procedural approach to n-player fair-division problems |
scientific article; zbMATH DE number 2214385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems |
scientific article; zbMATH DE number 2214385 |
Statements
Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (English)
0 references
14 October 2005
0 references
0.8414334058761597
0 references
0.8375003337860107
0 references
0.8355076313018799
0 references
0.8352341055870056
0 references
