中文
相关论文

相关论文: Minibal: Balanced Game-Playing Without Opponent Mo…

200 篇论文

We do not know how to align a very intelligent AI agent's behavior with human interests. I investigate whether -- absent a full solution to this AI alignment problem -- we can build smart AI agents which have limited impact on the world,…

人工智能 · 计算机科学 2022-06-24 Alexander Matt Turner

Game-playing agents like AlphaGo have achieved superhuman performance through self-play, which is theoretically guaranteed to yield optimal policies in competitive games. However, most language tasks are partially or fully cooperative, so…

计算与语言 · 计算机科学 2024-12-10 Austen Liao , Nicholas Tomlin , Dan Klein

AI researchers have long focused on poker-like games as a testbed for environments characterized by multi-player dynamics, imperfect information, and reasoning under uncertainty. While recent breakthroughs have matched elite human play at…

人工智能 · 计算机科学 2026-05-04 Richard Dewey , Janos Botyanszki , Ciamac C. Moallemi , Andrew T. Zheng

Chess has long been a testbed for AI's quest to match human intelligence, and in recent years, chess AI systems have surpassed the strongest humans at the game. However, these systems are not human-aligned; they are unable to match the…

机器学习 · 计算机科学 2024-10-08 Yiming Zhang , Athul Paul Jacob , Vivian Lai , Daniel Fried , Daphne Ippolito

We consider the task of building strong but human-like policies in multi-agent decision-making problems, given examples of human behavior. Imitation learning is effective at predicting human actions but may not match the strength of expert…

多智能体系统 · 计算机科学 2022-02-18 Athul Paul Jacob , David J. Wu , Gabriele Farina , Adam Lerer , Hengyuan Hu , Anton Bakhtin , Jacob Andreas , Noam Brown

We present PORTAL, a novel framework for developing artificial intelligence agents capable of playing thousands of 3D video games through language-guided policy generation. By transforming decision-making problems into language modeling…

机器学习 · 计算机科学 2025-03-18 Zhongwen Xu , Xianliang Wang , Siyi Li , Tao Yu , Liang Wang , Qiang Fu , Wei Yang

We study the problem of guaranteeing low regret in repeated games against an opponent with unknown membership in one of several classes. We add the constraint that our algorithm is non-exploitable, in that the opponent lacks an incentive to…

计算机科学与博弈论 · 计算机科学 2022-07-05 Anthony DiGiovanni , Ambuj Tewari

We study a variant of a recently introduced min-max optimization framework where the max-player is constrained to update its parameters in a greedy manner until it reaches a first-order stationary point. Our equilibrium definition for this…

机器学习 · 计算机科学 2022-07-04 Vijay Keswani , Oren Mangoubi , Sushant Sachdeva , Nisheeth K. Vishnoi

Game theory offers a powerful framework for analyzing strategic interactions among decision-makers, providing tools to model, analyze, and predict their behavior. However, implementing game theory can be challenging due to difficulties in…

计算机科学与博弈论 · 计算机科学 2024-05-15 Yaoqi Yang , Hongyang Du , Geng Sun , Zehui Xiong , Dusit Niyato , Zhu Han

We consider $\epsilon$-equilibria notions for constant value of $\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that…

计算机科学与博弈论 · 计算机科学 2017-01-30 Itai Arieli , Yakov Babichenko

As autonomous AI agents increasingly mediate online platform markets, a fundamental question emerges: do these markets generate stable strategic outcomes? In repeated strategic environments, the Nash equilibrium provides a natural benchmark…

人工智能 · 计算机科学 2026-04-28 Enoch Hyunwook Kang

To make AI systems broadly useful for challenging real-world tasks, we need them to learn complex human goals and preferences. One approach to specifying complex goals asks humans to judge during training which agent behaviors are safe and…

机器学习 · 统计学 2018-10-23 Geoffrey Irving , Paul Christiano , Dario Amodei

We investigate the problem of learning an equilibrium in a generalized two-sided matching market, where agents can adaptively choose their actions based on their assigned matches. Specifically, we consider a setting in which matched agents…

机器学习 · 计算机科学 2025-06-05 Andreas Athanasopoulos , Christos Dimitrakakis

Recently, researchers have discovered that the state-of-the-art object classifiers can be fooled easily by small perturbations in the input unnoticeable to human eyes. It is also known that an attacker can generate strong adversarial…

机器学习 · 计算机科学 2018-06-28 Jihun Hamm , Akshay Mehra

We investigate a repeated two-player zero-sum game setting where the column player is also a designer of the system, and has full control on the design of the payoff matrix. In addition, the row player uses a no-regret algorithm to…

计算机科学与博弈论 · 计算机科学 2023-02-16 Le Cong Dinh , Nick Bishop , Long Tran-Thanh

AI-controlled characters in fighting games are expected to possess reasonably high skills and behave in a believable, human-like manner, exhibiting a diversity of play styles and strategies. Thus, the development of fighting game AI…

人工智能 · 计算机科学 2021-08-10 Kaori Yuda , Shota Kamei , Riku Tanji , Ryoya Ito , Ippo Wakana , Maxim Mozgovoy

The existence of a phase transition with diverging susceptibility in batch Minority Games (MGs) is the mark of informationally efficient regimes and is linked to the specifics of the agents' learning rules. Here we study how the standard…

物理与社会 · 物理学 2009-11-13 Tobias Galla , Andrea De Martino

Recently, there have been several high-profile achievements of agents learning to play games against humans and beat them. In this paper, we study the problem of training intelligent agents in service of game development. Unlike the agents…

In this paper I present several algorithmic techniques for improving the decision process of multiple types of agents behaving in environments where their interests are in conflict. The interactions between the agents are modelled by using…

计算机科学与博弈论 · 计算机科学 2009-08-04 Mugurel Ionut Andreica

This paper studies the optimization of strategies in the context of possibly randomized two players zero-sum games with incomplete information. We compare 5 algorithms for tuning the parameters of strategies over a benchmark of 12 games. A…

计算机科学与博弈论 · 计算机科学 2018-07-06 Marie-Liesse Cauwet , Olivier Teytaud
‹ 上一页 1 8 9 10 下一页 ›