中文
相关论文

相关论文: Policy Based Inference in Trick-Taking Card Games

200 篇论文

We study the problem of implementing equilibria of complete information games in settings of incomplete information, and address this problem using "recommender mechanisms." A recommender mechanism is one that does not have the power to…

计算机科学与博弈论 · 计算机科学 2015-12-11 Michael Kearns , Mallesh M. Pai , Aaron Roth , Jonathan Ullman

Encoding and decoding are the two key steps in information processing. In this work we study the encoding and decoding capabilities of operational theories in the context of information-storability game, where the task is to freely choose a…

量子物理 · 物理学 2024-07-19 Teiko Heinosaari , Leevi Leppäjärvi , Martin Plávala

We propose InfoChess, a symmetric adversarial game that elevates competitive information acquisition to the primary objective. There is no piece capture, removing material incentives that would otherwise confound the role of information.…

多智能体系统 · 计算机科学 2026-04-20 Kieran A. Murphy

In stochastic games with incomplete information, the uncertainty is evoked by the lack of knowledge about a player's own and the other players' types, i.e. the utility function and the policy space, and also the inherent stochasticity of…

机器学习 · 计算机科学 2022-03-21 Hannes Eriksson , Debabrota Basu , Mina Alibeigi , Christos Dimitrakakis

The ability to inferring latent psychological traits from human behavior is key to developing personalized human-interacting machine learning systems. Approaches to infer such traits range from surveys to manually-constructed experiments…

机器学习 · 计算机科学 2019-12-13 Fan Yang , Liu Leqi , Yifan Wu , Zachary C. Lipton , Pradeep Ravikumar , William W. Cohen , Tom Mitchell

In this work, we provide an industry research view for approaching the design, deployment, and operation of trustworthy Artificial Intelligence (AI) inference systems. Such systems provide customers with timely, informed, and customized…

A key challenge in non-cooperative multi-agent systems is that of developing efficient planning algorithms for intelligent agents to interact and perform effectively among boundedly rational, self-interested agents (e.g., humans). The…

人工智能 · 计算机科学 2013-04-19 Trong Nghia Hoang , Kian Hsiang Low

We consider scenarios from the real-time strategy game StarCraft as new benchmarks for reinforcement learning algorithms. We propose micromanagement tasks, which present the problem of the short-term, low-level control of army members…

人工智能 · 计算机科学 2016-11-29 Nicolas Usunier , Gabriel Synnaeve , Zeming Lin , Soumith Chintala

There has been a surge of recent interest in automatically learning policies to target treatment decisions based on rich individual covariates. In addition, practitioners want confidence that the learned policy has better performance than…

机器学习 · 统计学 2026-02-10 Hamsa Bastani , Osbert Bastani , Bryce McLaughlin

Online platforms routinely compare multi-armed bandit algorithms, such as UCB and Thompson Sampling, to select the best-performing policy. Unlike standard A/B tests for static treatments, each run of a bandit algorithm over $T$ users…

机器学习 · 计算机科学 2026-04-14 Huiling Meng , Ningyuan Chen , Xuefeng Gao

Conversational AI has a fundamental flaw as a knowledge interface: sycophantic chatbots induce epistemic entrenchment and delusional belief spirals even in rational agents. We propose the problem does not stem from the AI model, rooted…

人工智能 · 计算机科学 2026-05-12 Will Beaumaster , Paul Schrater

Poker is ideal for testing automated reasoning under uncertainty. It introduces uncertainty both by physical randomization and by incomplete information about opponents hands.Another source OF uncertainty IS the limited information…

人工智能 · 计算机科学 2013-01-30 Kevin B. Korb , Ann Nicholson , Nathalie Jitnah

One common assumption in game theory is that any player optimizes a utility function that takes into account only its own payoff. However, it has long been observed that in real life players may adopt an altruistic or even spiteful…

计算机科学与博弈论 · 计算机科学 2025-11-25 Michail Fasoulakis , Leonidas Bakopoulos , Charilaos Akasiadis , Georgios Chalkiadakis

This paper proposes to use probabilistic model checking to synthesize optimal robot policies in multi-tasking autonomous systems that are subject to human-robot interaction. Given the convincing empirical evidence that human behavior can be…

人工智能 · 计算机科学 2016-11-01 Sebastian Junges , Nils Jansen , Joost-Pieter Katoen , Ufuk Topcu

As AI technology advances, research in playing text-based games with agents has becomeprogressively popular. In this paper, a novel approach to agent design and agent learning ispresented with the context of reinforcement learning. A model…

计算与语言 · 计算机科学 2025-09-04 Haonan Wang , Mingjia Zhao , Junfeng Sun , Wei Liu

Exploration is essential in reinforcement learning, particularly in environments where external rewards are sparse. Here we focus on exploration with intrinsic rewards, where the agent transiently augments the external rewards with…

机器学习 · 计算机科学 2024-01-26 Changmin Yu , Neil Burgess , Maneesh Sahani , Samuel J. Gershman

This paper presents a novel approach combining inductive logic programming with reinforcement learning to improve training performance and explainability. We exploit inductive learning of answer set programs from noisy examples to learn a…

人工智能 · 计算机科学 2025-01-14 Celeste Veronese , Daniele Meli , Alessandro Farinelli

The study of online decision-making problems that leverage contextual information has drawn notable attention due to their significant applications in fields ranging from healthcare to autonomous systems. In modern applications, contextual…

机器学习 · 统计学 2025-04-22 Qiyu Han , Will Wei Sun , Yichen Zhang

We study the problem of off-policy evaluation for slate bandits, for the typical case in which the logging policy factorizes over the slots of the slate. We slightly depart from the existing literature by taking Bayes risk as the criterion…

机器学习 · 计算机科学 2021-01-08 Nikos Vlassis , Fernando Amat Gil , Ashok Chandrashekar

The experience replay mechanism allows agents to use the experiences multiple times. In prior works, the sampling probability of the transitions was adjusted according to their importance. Reassigning sampling probabilities for every…

机器学习 · 计算机科学 2021-11-15 Dogan C. Cicek , Enes Duran , Baturay Saglam , Furkan B. Mutlu , Suleyman S. Kozat
‹ 上一页 1 8 9 10 下一页 ›