Nash implementation in rationing problems with single-crossing preferences (Q486479)
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: Nash implementation in rationing problems with single-crossing preferences |
scientific article; zbMATH DE number 6387051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nash implementation in rationing problems with single-crossing preferences |
scientific article; zbMATH DE number 6387051 |
Statements
Nash implementation in rationing problems with single-crossing preferences (English)
0 references
15 January 2015
0 references
Nash implementation
0 references
rationing problem
0 references
single-crossing preferences
0 references
0.8690793514251709
0 references
0.8449596166610718
0 references
0.8410530686378479
0 references
0.8252633213996887
0 references
0.8198384642601013
0 references
