.png){kind=icon}
.png){kind=icon}
Return
Efficient Repeated Implementation
.png){kind=icon}
OA
AI
DOI：10.3982/ECTA8859.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper examines repeated implementation of a social choice function (SCF) with infinitely lived agents whose preferences are determined randomly in each period. An SCF is repeatedly implementable in Nash equilibrium if there exists a sequence of (possibly history-dependent) mechanisms such that its Nash equilibrium set is nonempty and every equilibrium outcome path results in the desired social choice at every possible history of past play and realizations of uncertainty. We show, with minor qualifications, that in the complete information environment an SCF is repeatedly implementable in Nash equilibrium if and only if it is efficient. We also discuss several extensions of our analysis.
Keywords:
Repeated implementation
Nash implementation
efficiency
mixed strategies
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
3.0K
Citations:
4.3W