Identifying and Responding to Cooperative Actions in General-sum Normal Form Games

被引:0
|
作者
Damer, Steven [1 ]
机构
[1] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
My primary research interest is social behavior of software agents acting in general-sum normal form games. In an environment with another agent, an agent needs to be able to identify if the opponent is hostile or cooperative by looking at the opponent's actions, and respond appropriately. If the opponent is hostile, the agent should guard against it. Even for a self-interested agent, cooperative actions may be necessary to induce reciprocative cooperation on the part of the opponent. In some games it is easy to identify hostile or cooperative actions, but in an arbitrary general-sum game this is not easy. We introduce attitude, a method of identifying cooperative actions, and Restricted Stackelberg Response with Safety (RSRS), a solution concept for normal-form games suitable for situations where a prediction of the opponent behavior is available. Our goal is to combine attitude and RSRS to enable an agent to achieve a cooperative outcome in any general-sum game while avoiding exploitation.
引用
收藏
页码:1826 / 1827
页数:2
相关论文
共 50 条
  • [1] Safely Using Predictions in General-Sum Normal Form Games
    Damer, Steven
    Gini, Maria
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 924 - 932
  • [2] A new learning algorithm for cooperative agents in general-sum games
    Song, Mei-Ping
    An, Ju-Bai
    Chen, Rong
    PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 50 - 54
  • [3] Pareto-Q learning algorithm for cooperative agents in general-sum games
    Song, MP
    Gu, GC
    Zhang, GY
    MULTI-AGENT SYSTEMS AND APPLICATIONS IV, PROCEEDINGS, 2005, 3690 : 576 - 578
  • [4] Convergent gradient ascent in general-sum games
    Banerjee, B
    Peng, J
    MACHINE LEARNING: ECML 2002, 2002, 2430 : 1 - 9
  • [5] Convergent gradient ascent with momentum in general-sum games
    Zhang, HX
    Huang, ST
    NEUROCOMPUTING, 2004, 61 (1-4) : 449 - 454
  • [6] Decentralized Online Learning in General-Sum Stackelberg Games
    Yu, Yaolong
    Chen, Haipeng
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2024, 244 : 4056 - 4077
  • [7] Computing Stackelberg Equilibria of Large General-Sum Games
    Blum, Avrim
    Haghtalab, Nika
    Hajiaghayi, MohammadTaghi
    Seddighin, Saeed
    ALGORITHMIC GAME THEORY (SAGT 2019), 2019, 11801 : 168 - 182
  • [8] General-sum stochastic games: Verifiability conditions for Nash equilibria
    Prasad, H. L.
    Bhatnagar, S.
    AUTOMATICA, 2012, 48 (11) : 2923 - 2930
  • [9] PAC Reinforcement Learning Algorithm for General-Sum Markov Games
    Zehfroosh, Ashkan
    Tanner, Herbert G.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (05) : 2821 - 2831
  • [10] OPTIMISTIC GRADIENT DESCENT ASCENT IN GENERAL-SUM BILINEAR GAMES
    DE Montbrun, Etienne
    Renault, Jerome
    JOURNAL OF DYNAMICS AND GAMES, 2024,