Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case (Q5283446): Difference between revisions
From MaRDI portal
Latest revision as of 04:48, 14 July 2024
scientific article; zbMATH DE number 6751266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case |
scientific article; zbMATH DE number 6751266 |
Statements
Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case (English)
0 references
21 July 2017
0 references
budget constraints
0 references
dictatorship
0 references
Pareto efficiency
0 references
incentive compatibility
0 references
0 references
