RUS  ENG
Full version
JOURNALS // Matematicheskaya Teoriya Igr i Ee Prilozheniya // Archive

Mat. Teor. Igr Pril., 2014 Volume 6, Issue 2, Pages 60–77 (Mi mgta134)

This article is cited in 2 papers

Rosenthal's potential and a discrete version of the Debreu–Gorman theorem

Nikolai S. Kukushkin

Russian Academy of Sciences, Dorodnicyn Computing Center

Abstract: 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”. Every universal separable ordering on a finite set can be represented as a combination of addition and lexicography.

UDC: 519.8
BBK: 22.18


 English version:
Automation and Remote Control, 2015, 76:6, 1101–1110

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024