Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59567287, #quickstatements; #temporary_batch_1706974288397 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59567287 / rank | |||
Normal rank | |||
Revision as of 18:01, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems |
scientific article |
Statements
Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (English)
0 references
14 October 2005
0 references
