Show simple item record

AuthorAfacan, Mustafa Oğuz
Available date2023-07-23T10:14:50Z
Publication Date2023-03-28
Publication NameTheory and Decision
Identifierhttp://dx.doi.org/10.1007/s11238-023-09925-z
CitationAfacan, M. O. (2023). Axiomatic characterizations of the constrained probabilistic serial mechanism. Theory and Decision, 1-20.
ISSN0040-5833
URIhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85151285821&origin=inward
URIhttp://hdl.handle.net/10576/46136
AbstractAfacan (Games and Economic Behavior 110: 71-89, 2018) introduces an object allocation with random priorities problem. He proposes the constrained probabilistic serial (CPS) mechanism. This study, for the first time in the literature, provides axiomatic characterizations of CPS. The first result characterizes it via non-wastefulness, claimwise stability, constrained ordinal fairness, and surplus invariance to truncations. The other axiomatizes CPS via constrained stochastic efficiency, claimwise stability, and constrained ordinal fairness. The independence of the axioms is provided.
Languageen
PublisherSpringer Nature
SubjectAxiom
Characterization
Claimwise stability
Constrained ordinal fairness
Constrained probabilistic serial
Matching
TitleAxiomatic characterizations of the constrained probabilistic serial mechanism
TypeArticle
Pagination1-20
ESSN1573-7187
dc.accessType Open Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record