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

Barlo, Mehmet; Dalkiran, Nuh Aygun

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/260741</identifier>
  <creators>
    <creator>
      <creatorName>Barlo, Mehmet</creatorName>
      <givenName>Mehmet</givenName>
      <familyName>Barlo</familyName>
      <affiliation>Sabanci Univ, Fac Arts &amp; Social Sci, Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Dalkiran, Nuh Aygun</creatorName>
      <givenName>Nuh Aygun</givenName>
      <familyName>Dalkiran</familyName>
      <affiliation>Bilkent Univ, Dept Econ, Ankara, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Computational Implementation</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2022</publicationYear>
  <dates>
    <date dateType="Issued">2022-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/260741</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1007/s10058-021-00282-3</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">Following a theoretical analysis of the scope of Nash implementation for a given mechanism, we study the formal framework for computational identification of Nash implementability. We provide computational tools for Nash implementation in finite environments. In particular, we supply Python codes that identify (i) the domain of preferences that allows Nash implementation by a given mechanism, (ii) the maximal domain of preferences that a given mechanism Nash implements Pareto efficiency, (iii) all consistent collections of sets of a given social choice correspondence (SCC), the existence of which is a necessary condition for Nash implementation of this SCC, and (iv) check whether some of the well-known sufficient conditions for Nash implementation hold for a given SCC. Our results exhibit that the computational identification of all collections consistent with an SCC enables the planner to design appealing mechanisms.</description>
  </descriptions>
</resource>