What matchings can be stable? The testable implications of matching theory (Q3168993)
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: What matchings can be stable? The testable implications of matching theory |
scientific article; zbMATH DE number 5881597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | What matchings can be stable? The testable implications of matching theory |
scientific article; zbMATH DE number 5881597 |
Statements
What Matchings Can Be Stable? The Testable Implications of Matching Theory (English)
0 references
27 April 2011
0 references
stable matchings
0 references
revealed preference
0 references
inverse optimization
0 references
0.8746833801269531
0 references
0.8716441988945007
0 references
0.822693943977356
0 references
0.780302882194519
0 references
0.7763146162033081
0 references
