A necessary and sufficient condition for stable matching rules to be strategy-proof (Q2513288)
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: A necessary and sufficient condition for stable matching rules to be strategy-proof |
scientific article; zbMATH DE number 6394192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary and sufficient condition for stable matching rules to be strategy-proof |
scientific article; zbMATH DE number 6394192 |
Statements
A necessary and sufficient condition for stable matching rules to be strategy-proof (English)
0 references
2 February 2015
0 references
0 references
0.8345934748649597
0 references
0.8109236359596252
0 references
0.8030795454978943
0 references
0.8024733066558838
0 references
0.8014989495277405
0 references
