Results 41 to 48 of about 62 (48)
Minimal Maskin Monotonic Extensions of Tournament Solutions
In this paper we give a general characterization of the minimal Maskin monotonic extensions of Condorcet consistent tournament solutions. We then compute the minimal Maskin monotonic extensions for the following rules: The top-cycle, the uncovered set, the iterated uncovered set, the minimal covering set and the Copeland rule. Moreover, we characterize
İpek Özkal-Sanver +2 more
openalex +2 more sources
Maskin monotonic aggregation rules and partial anonymity
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Powers
openalex +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Keisuke Bando, Kenzo Imamura
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Maximal Domains for Maskin Monotone Pareto Optimal and Anonymous Choice Rules
2010We consider domain restrictions that allow for Maskin monotone Pareto optimal and anonymous choice rules. The set of precisely one agent is restricted as minimal as possible yielding in this way a maximal domains allowing for such functions. In view of the impossibility results like Gibbard Satterthwaite, these maximal domains somehow bring about ...
Olivier Bochet, Ton Storcken
openaire +1 more source
Maximal Domains for Strategy-Proof or Maskin Monotonic Choice Rules
Olivier Bochet, Ton Storcken
openalex

