期刊
INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING
卷 8, 期 2, 页码 193-216出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0219622009003430
关键词
Game theory; non-cooperative lexicographical games; affine games; equalized situation; Nash's equilibrium
This article is about the full analysis of one concrete class of general non-cooperative lexicographic games and its computer programming. In such game, the payoffs of players are lexicographic vector payoffs - m scalar criteria vectors. At the same time, these criteria are strictly ranked on the set of the situations with lexicographic preference. In some such kind of game a Nash's equilibrium may not exist. In the given article the full analysis of one class of dyadic lexicographic games is worked out. Such kind of class is the non-cooperative lexicographic games, where each player has got two pure strategies and the payoff of each player solely depends on the strategies of two players in each situation. Therefore, the player's payoffs are given by 2 x 2 matrices, the elements of which are lexicographic utilities.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据