Computing Nash Equilibria in Non-Cooperative Games

Author:

Garro Alfredo1

Affiliation:

1. Department of Informatics, Modeling, Electronics and Systems Engineering (DIMES),University of Calabria, Rende CS, Italy

Abstract

Game Theory has recently drawn attention in new fields which go from algorithmic mechanism design to cybernetics. However, a fundamental problem to solve for effectively applying Game Theory in real word applications is the definition of well-founded solution concepts of a game and the design of efficient algorithms for their computation. A widely accepted solution concept for games in which any cooperation among the players must be self-enforcing (non-cooperative games) is represented by the Nash equilibrium. However, even in the two players case, the best algorithm known for computing Nash equilibria has an exponential worst-case running time; furthermore, if the computation of equilibria with simple additional properties is required, the problem becomes NP-hard. The paper aims to provide a solution for efficiently computing the Nash equilibria of a game as the result of the evolution of a system composed by interacting agents playing the game.

Publisher

IGI Global

Subject

Artificial Intelligence,Industrial and Manufacturing Engineering,Mechanical Engineering,Control and Systems Engineering

Reference33 articles.

1. Developing multi‐agent systems with a FIPA‐compliant agent framework

2. Mixed Equilibria and Dynamical Systems Arising from Fictitious Play in Perturbed Games

3. Fictitious play in 2×n games

4. Bonifaci, V., Di Iorio, U., & Laura, L. (2005). On the complexity of uniformly mixed Nash equilibria and related regular subgraph problems. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (pp. 197-208).

5. Carmel, D., & Markovitch, S. (1996). Learning models of intelligent agents. In Proceedings of the 13th National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference (Vol. 2, pp. 62-67). Menlo Park, CA: AAAI Press.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3