An Approach to Cooperation in General-Sum Normal Form Games
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3984-3984.
Abstract
My primary research interest is social behavior for software agents to achieve cooperation in general-sum normal form games. An agent can easily be programmed to constantly cooperate in a normal form game, but such an agent is not suitable for environments with potentially hostile opponents. For a rational agent, the main reason to cooperate is to induce reciprocation; to reciprocate it is necessary to determine which moves are cooperative. In constant-sum games cooperation is impossible because any gain by one agent isa loss by the other agent. In other games (such as Prisoner's Dilemma) it is easy to identify cooperative moves because the opponent's payoffs for that move strictly dominate the other moves of the agent. In general it is not easy to identify cooperative strategies in arbitrary general-sum games.
@inproceedings{ijcai2016p566,
title = {An Approach to Cooperation in General-Sum Normal Form Games},
author = {Damer, Steven},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {3984--3984},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/566},
}
TY - CPAPER TI - An Approach to Cooperation in General-Sum Normal Form Games AU - Damer, Steven T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 3984 EP - 3984 UR - https://ijcai.org/proceedings/2016/566 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
