Computational implementation

Barlo, Mehmet and Dalkıran, Nuh Aygün (2022) Computational implementation. Review of Economic Design . ISSN 1434-4742 (Print) 1434-4750 (Online) Published Online First

There is a more recent version of this item available.
Full text not available from this repository. (Request a copy)


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.
Item Type: Article
Uncontrolled Keywords: Behavioral implementation; Computation; Consistent collections; Maskin monotonicity; Maximal domain; Nash implementation
Divisions: Faculty of Arts and Social Sciences
Depositing User: Mehmet Barlo
Date Deposited: 26 Aug 2022 09:23
Last Modified: 26 Aug 2022 09:23

Available Versions of this Item

Actions (login required)

View Item
View Item