A polynomial-time Nash equilibrium algorithm for repeated games-Reference-Cited by-同舟云学术

A polynomial-time Nash equilibrium algorithm for repeated games

Published:2005-03 Issue:1 Volume:39 Page:55-66
ISSN:0167-9236
Container-title:Decision Support Systems
language:en
Short-container-title:Decision Support Systems

Author:

Littman Michael L.,Stone Peter

Publisher

Elsevier BV

Subject

Information Systems and Management,Arts and Humanities (miscellaneous),Developmental and Educational Psychology,Information Systems,Management Information Systems

Reference16 articles.

1. The Evolution of Cooperation;Axelrod,1984

2. Efficient learning equilibrium;Brafman,2003

3. Complexity results about Nash equilibria;Conitzer,2003

4. FAucS: an FCC spectrum auction simulator for autonomous bidding agents;Csirik,2001

5. Graphical models for game theory;Kearns,2001

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

1. Intragroup-to-intergroup game envelopment analysis: Multi-subgroup modeling, dual Nash equilibrium, and dynamic evaluation application;Engineering Applications of Artificial Intelligence;2024-09

2. A polynomial-time algorithm for the optimal offer in Single-Area Day-Ahead Electricity Markets;Energy Systems;2023-10-19

3. Negotiation Strategies to Improve Distributed Power Allocation for Self-Organizing Heterogeneous Networks;2023 31st European Signal Processing Conference (EUSIPCO);2023-09-04

4. Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria;ACM Transactions on Economics and Computation;2022-03-31

5. Multi-Agent Reinforcement Learning with Optimal Equivalent Action of Neighborhood;Actuators;2022-03-25