Russian Academy of Sciences, Computing Center, Moscow. , 117967 , 09.2000 , p. 1-78, language: английский АннотацияSeveral sets of (mostly algebraic) conditions on a strategic game guaranteeing nice behaviour of best-reply processes are established. For example: all strategies are scalar, every player's utility only depends on his own choice and the sum of the partners' choices, and best replies are all increasing or all decreasing. An abstract approach to the problem is developed, formulated in terms of binary relations on a compact metric space, so it is, in principle, applicable to any equilibrium concept which can be defined as a maximizer for a binary relation. Ключевые слова
|
Наш адрес: 119991 ГСП-1 Москва В-71, Ленинский просп., 14 Телефон: 938-0309 (Справ. бюро) Факс: (495)954-3320 (Лен.пр.,14), (495)938-1844 (Лен.пр.,32а) | Назад |