Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s003550100149 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s003550100149 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134776949 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/scw/HaakeRS02 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S003550100149 / rank | |||
Normal rank | |||
Latest revision as of 06:59, 19 December 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
