| 来源类型 | Monograph (IIASA Working Paper) |
| 规范类型 | 论文 |
| Cycling with a Generalized Urn Scheme and a Learning Algorithm for 2X2 Games. | |
| Posch M | |
| 发表日期 | 1994 |
| 出版者 | IIASA, Laxenburg, Austria: WP-94-076 |
| 出版年 | 1994 |
| 语种 | 英语 |
| 摘要 | In this paper we explore a learning algorithm for 2x2 games. We assume that the players neither know the payoff matrix of their opponent nor their own and can only observe their own actions and their own payoffs. We prove that the learning process, which is modelled by a generalized urn scheme, converges to a pure strategy profile if the game has at least one strict Nash equilibrium. In case there is no strict Nash equilibrium, the learning algorithm exhibits oscillations. We derive sufficient conditions that cycling occurs in a generalized urn scheme. |
| 主题 | Dynamic Systems (DYN) |
| URL | http://pure.iiasa.ac.at/id/eprint/4135/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/124257 |
| 推荐引用方式 GB/T 7714 | Posch M. Cycling with a Generalized Urn Scheme and a Learning Algorithm for 2X2 Games.. 1994. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
| WP-94-076.pdf（795KB） | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 | ||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Posch M]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Posch M]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Posch M]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
