Kereső
Bejelentkezés
Kapcsolat
![]() |
Stable sets in one-seller assignment games |
Tartalom: | http://unipub.lib.uni-corvinus.hu/1322/ |
---|---|
Archívum: | Corvinus Kutatások |
Gyűjtemény: |
Status = In Press
Subject = Mathematics, Econometrics Type = Monograph |
Cím: |
Stable sets in one-seller assignment games
|
Létrehozó: |
Bednay, Dezső
|
Kiadó: |
Annals of Operation Research
|
Dátum: |
2013-07-10
|
Téma: |
Mathematics, Econometrics
|
Tartalmi leírás: |
We consider von Neumann -- Morgenstern stable sets in assignment games with one seller and many buyers. We prove that a set of imputations is a stable set if and only if it is the graph of a certain type of continuous and monotone function. This characterization enables us to interpret the standards of behavior encompassed by the various stable sets as possible outcomes of well-known auction procedures when groups of buyers may form bidder rings. We also show that the union of all stable sets can be described as the union of convex polytopes all of whose vertices are marginal
contribution payoff vectors. Consequently, each stable set is contained in the Weber set. The Shapley value, however, typically falls outside the union of all stable sets.
|
Típus: |
Monograph
NonPeerReviewed
|
Formátum: |
application/pdf
|
Azonosító: |
Bednay, Dezső (2013) Stable sets in one-seller assignment games. Manual. Annals of Operation Research. (In Press)
|
Kapcsolat: |