Non-manipulable solutions in a permit sharing problem: Equivalence between non-manipulability and monotonicity (Q1602001)
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: Non-manipulable solutions in a permit sharing problem: Equivalence between non-manipulability and monotonicity |
scientific article; zbMATH DE number 1761915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-manipulable solutions in a permit sharing problem: Equivalence between non-manipulability and monotonicity |
scientific article; zbMATH DE number 1761915 |
Statements
Non-manipulable solutions in a permit sharing problem: Equivalence between non-manipulability and monotonicity (English)
0 references
4 September 2002
0 references
permit sharing
0 references
manipulability
0 references
optimality
0 references
monotonicity
0 references
0.8782147169113159
0 references
0.7636686563491821
0 references
0.753398597240448
0 references
0.7465347051620483
0 references
0.7430332899093628
0 references
