Assortative Matching with Explicit Search Costs (Q3410708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5076781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Assortative Matching with Explicit Search Costs |
scientific article; zbMATH DE number 5076781 |
Statements
Assortative Matching with Explicit Search Costs (English)
0 references
30 November 2006
0 references
assortative matching
0 references
search frictions
0 references
transferable utility
0 references
assignment
0 references
supermodularity
0 references
0.8870484828948975
0 references
0.8842691779136658
0 references
0.849471926689148
0 references
0.8040317296981812
0 references
0.7976792454719543
0 references
