1 Ocak 2018 Dergi makalesi Açık Erişim

Afacan, Mustafa Oguz

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/36541</identifier>
  <creators>
    <creator>
      <creatorName>Afacan, Mustafa Oguz</creatorName>
      <givenName>Mustafa Oguz</givenName>
      <familyName>Afacan</familyName>
      <affiliation>Sabanci Univ, Fac Arts &amp; Social Sci, TR-34956 Istanbul, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>The Object Allocation Problem With Random Priorities</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2018</publicationYear>
  <dates>
    <date dateType="Issued">2018-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/36541</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.geb.2018.03.010</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">The existing priority-based object allocation literature restricts objects' priorities to be deterministic. However, agents might be probabilistically prioritized ex-ante, for instance, through a non-uniform tie-breaking rule. This paper generalizes the deterministic setting by allowing priorities to be random. In this probabilistic environment, we first introduce a fairness notion called claimwise stability in the spirit of the usual stability of Gale and Shapley (1962). We show that the natural generalization of the deferred acceptance mechanism (Gale and Shapley, 1962), so called probabilistic deferred acceptance mechanism, is claimwise stable, but with the downside that it is stochastically dominated by another claimwise stable rule. We then introduce a new mechanism called the constrained probabilistic serial, which is built on the probabilistic serial mechanism of Bogomolnaia and Moulin (2001). It is both claimwise stable and constrained sd-efficient. The paper then systematically compares the probabilistic deferred acceptance and constrained probabilistic serial mechanisms in terms of their strategic and fairness properties. (C) 2018 Elsevier Inc. All rights reserved.</description>
  </descriptions>
</resource>