The acyclicity of individual improvements in a generalized congestion game (where the sums of local utilities are replaced with arbitrary aggregation rules) can be established with a Rosenthal-style construction if aggregation rules of all players are “quasi-separable.” Each universal separable ordering on a finite set can be represented as a combination of addition and lexicography.
机构:
Univ Cambridge, Fac Econ, Cambridge CB3 9DD, England
New Coll Humanities, London WC1B 3HH, EnglandUniv Cambridge, Fac Econ, Cambridge CB3 9DD, England
Dasgupta, Partha Sarathi
Maskin, Eric S.
论文数: 0引用数: 0
h-index: 0
机构:
Harvard Univ, Dept Econ, Cambridge, MA 02138 USA
Higher Sch Econ, Moscow 101000, RussiaUniv Cambridge, Fac Econ, Cambridge CB3 9DD, England