Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/scw/HaakeRS02, #quickstatements; #temporary_batch_1731483406851 |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
Latest revision as of 09:06, 13 November 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
