An algorithmic approach to Nash implementation with two individuals

Abstract

This thesis investigates the Nash implementation problem in the behavioral domain with two individuals. By strengthening the necessary results in the literature and adopting an algorithmic approach, we provide constructive sufficiency results. Our findings facilitate the design of mechanisms in two individual environments where the individuals’ behavior may violate the standard axioms of rationality.