Compellingness in Nash implementation

A social choice function (SCF) is said to be Nash implementable if there exists a mechanism in which every Nash equilibrium outcome coincides with that specified by the SCF. The main objective of this paper is to assess the impact of considering mixed strategy equilibria in Nash implementation. To do...

Full description

Saved in:
Bibliographic Details
Main Authors: CHATTERJI, Shurojit, KUNIMOTO, Takashi, RAMOS, Paulo Daniel Salles
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2024
Subjects:
Online Access:https://ink.library.smu.edu.sg/soe_research/2626
https://ink.library.smu.edu.sg/context/soe_research/article/3625/viewcontent/Compelling_Implementation_11_Feb_2024_.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.soe_research-3625
record_format dspace
spelling sg-smu-ink.soe_research-36252024-02-13T06:43:11Z Compellingness in Nash implementation CHATTERJI, Shurojit KUNIMOTO, Takashi RAMOS, Paulo Daniel Salles A social choice function (SCF) is said to be Nash implementable if there exists a mechanism in which every Nash equilibrium outcome coincides with that specified by the SCF. The main objective of this paper is to assess the impact of considering mixed strategy equilibria in Nash implementation. To do this, we focus on environments with two agents and restrict attention to finite mechanisms. We call a mixed strategy equilibrium “compelling” if its outcome Pareto dominates any pure strategy equilibrium outcome. We show that if the finite environment and the SCF to be implemented jointly satisfy what we call Condition P+M, we construct a finite mechanism which Nash implements the SCF in pure strategies and possesses no compelling mixed strategy equilibria. This means that the mechanism might possess mixed strategy equilibria which are “not” compelling. Our mechanism has several desirable features: transfers can be completely dispensable; only fi-nite mechanisms are considered; integer games are not invoked; and players’ attitudes toward risk do not matter. 2024-02-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/soe_research/2626 https://ink.library.smu.edu.sg/context/soe_research/article/3625/viewcontent/Compelling_Implementation_11_Feb_2024_.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Economics eng Institutional Knowledge at Singapore Management University implementation compelling equilibria ordinality mixed strate-gies Nash equilibrium. Economic Theory
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic implementation
compelling equilibria
ordinality
mixed strate-gies
Nash equilibrium.
Economic Theory
spellingShingle implementation
compelling equilibria
ordinality
mixed strate-gies
Nash equilibrium.
Economic Theory
CHATTERJI, Shurojit
KUNIMOTO, Takashi
RAMOS, Paulo Daniel Salles
Compellingness in Nash implementation
description A social choice function (SCF) is said to be Nash implementable if there exists a mechanism in which every Nash equilibrium outcome coincides with that specified by the SCF. The main objective of this paper is to assess the impact of considering mixed strategy equilibria in Nash implementation. To do this, we focus on environments with two agents and restrict attention to finite mechanisms. We call a mixed strategy equilibrium “compelling” if its outcome Pareto dominates any pure strategy equilibrium outcome. We show that if the finite environment and the SCF to be implemented jointly satisfy what we call Condition P+M, we construct a finite mechanism which Nash implements the SCF in pure strategies and possesses no compelling mixed strategy equilibria. This means that the mechanism might possess mixed strategy equilibria which are “not” compelling. Our mechanism has several desirable features: transfers can be completely dispensable; only fi-nite mechanisms are considered; integer games are not invoked; and players’ attitudes toward risk do not matter.
format text
author CHATTERJI, Shurojit
KUNIMOTO, Takashi
RAMOS, Paulo Daniel Salles
author_facet CHATTERJI, Shurojit
KUNIMOTO, Takashi
RAMOS, Paulo Daniel Salles
author_sort CHATTERJI, Shurojit
title Compellingness in Nash implementation
title_short Compellingness in Nash implementation
title_full Compellingness in Nash implementation
title_fullStr Compellingness in Nash implementation
title_full_unstemmed Compellingness in Nash implementation
title_sort compellingness in nash implementation
publisher Institutional Knowledge at Singapore Management University
publishDate 2024
url https://ink.library.smu.edu.sg/soe_research/2626
https://ink.library.smu.edu.sg/context/soe_research/article/3625/viewcontent/Compelling_Implementation_11_Feb_2024_.pdf
_version_ 1794549517691912192