Simple reinforcement learning agents: Pareto beats Nash in an algorithmic game theory study
Year of publication: |
2005
|
---|---|
Authors: | Kimbrough, Steven O. ; Lu, Ming |
Published in: |
Information systems and e-business management : ISeB. - New York, NY [u.a.] : Springer, ISSN 1617-9846, ZDB-ID 2069863X. - Vol. 3.2005, 1, p. 1-19
|
Saved in:
Saved in favorites
Similar items by person
-
A note on strategic learning in policy space
Kimbrough, Steven O., (2005)
-
Learning and tacit collusion by artificial agents in Cournot duopoly games
Kimbrough, Steven O., (2005)
-
Simple reinforcement learning agents: Pareto beats Nash in an algorithmic game theory study
Kimbrough, Steven O., (2005)
- More ...