English
Related papers

Related papers: Application of the EWL protocol to decision proble…

200 papers

The study focuses on strategic-form games extended in the Eisert-Wilkens-Lewenstein scheme by two unitary operations. Conditions are determined under which the pair of unitary operators, along with classical strategies, form a game…

Quantum Physics · Physics 2024-09-13 Piotr Frąckiewicz , Anna Gorczyca-Goraj , Marek Szopa

In game theory, imperfect-recall decision problems model situations in which an agent forgets information it held before. They encompass games such as the ``absentminded driver'' and team games with limited communication. In this paper, we…

Computer Science and Game Theory · Computer Science 2026-02-18 Emanuel Tewolde , Brian Hu Zhang , Ioannis Anagnostides , Tuomas Sandholm , Vincent Conitzer

Alternating-time Temporal Logic (ATL*) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATL*i ) is well known to have an undecidable model-checking problem when agents have perfect recall.…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano

Optimal action selection in decision problems characterized by sparse, delayed rewards is still an open challenge. For these problems, current deep reinforcement learning methods require enormous amounts of data to learn controllers that…

Artificial Intelligence · Computer Science 2018-06-18 Miquel Junyent , Anders Jonsson , Vicenç Gómez

Extensive-form games constitute the standard representation scheme for games with a temporal component. But do all extensive-form games correspond to protocols that we can implement in the real world? We often rule out games with imperfect…

Computer Science and Game Theory · Computer Science 2015-02-12 Sune K. Jakobsen , Troels B. Sørensen , Vincent Conitzer

This paper investigates repeated win-lose coordination games (WLC-games). We analyse which protocols are optimal for these games covering both the worst case and average case scenarios, i,e., optimizing the guaranteed and expected…

Computer Science and Game Theory · Computer Science 2020-04-17 Antti Kuusisto , Raine Rönnholm

We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. An example is the absentminded driver game, as well as team games in which the members have limited communication…

Computer Science and Game Theory · Computer Science 2024-06-25 Emanuel Tewolde , Brian Hu Zhang , Caspar Oesterheld , Manolis Zampetakis , Tuomas Sandholm , Paul W. Goldberg , Vincent Conitzer

This paper investigates repeated win-lose coordination games (WLC-games). We analyse which protocols are optimal for these games, covering both the worst case and average case scenarios, i,e., optimizing the guaranteed and expected…

Computer Science and Game Theory · Computer Science 2021-09-20 Antti Kuusisto , Raine Rönnholm

We examine sequential equilibrium in the context of computational games, where agents are charged for computation. In such games, an agent can rationally choose to forget, so issues of imperfect recall arise. In this setting, we consider…

Computer Science and Game Theory · Computer Science 2014-12-22 Joseph Y. Halpern , Rafael Pass

The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of $n$ devices is intended to apply the same unitary…

Quantum Physics · Physics 2026-05-07 Santiago Llorens , Arnau Diebra , Michal Sedlák , Ramon Muñoz-Tapia

In games with imperfect recall, players may forget the sequence of decisions they made in the past. When players also forget whether they have already encountered their current decision point, they are said to be absent-minded. Solving…

Computer Science and Game Theory · Computer Science 2025-02-20 Hugo Gimbert , Soumyajit Paul , B. Srivathsan

We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous…

Machine Learning · Computer Science 2020-07-13 Pier Giuseppe Sessa , Ilija Bogunovic , Maryam Kamgarpour , Andreas Krause

Recent advancements in algorithms for sequential decision-making under imperfect information have shown remarkable success in large games such as limit- and no-limit poker. These algorithms traditionally formalize the games using the…

Computer Science and Game Theory · Computer Science 2023-12-07 Vojtěch Kovařík , David Milec , Michal Šustr , Dominik Seitz , Viliam Lisý

Maximally entangled Eisert-Lewenstein-Wilkens games are analyzed. For a general class of gate operators defined in the previous papers of the first author the general conditions are derived which allow to determine the form of gate…

Quantum Physics · Physics 2015-11-25 Katarzyna Bolonek-Lasoń , Piotr Kosiński

Analyzing decision problems under uncertainty commonly relies on idealizing assumptions about the describability of the world, with the most prominent examples being the closed world and the small world assumption. Most assumptions are…

Methodology · Statistics 2025-12-08 Christoph Jansen , Georg Schollmeyer , Thomas Augustin , Julian Rodemann

Random selection, leader election, and collective coin flipping are fundamental tasks in fault-tolerant distributed computing. We study these problems in the full-information model where despite decades of study, key gaps remain in our…

Computational Complexity · Computer Science 2026-04-30 Eshan Chattopadhyay , Mohit Gurumukhani , Noam Ringach , Rocco A. Servedio

Game theory relies heavily on the availability of cardinal utility functions, but in fields such as matching markets, only ordinal preferences are typically elicited. The literature focuses on mechanisms with simple dominant strategies, but…

Computer Science and Game Theory · Computer Science 2024-08-22 Fabian R. Pieroth , Martin Bichler

Extensive-form games with imperfect recall are an important game-theoretic model that allows a compact representation of strategies in dynamic strategic interactions. Practical use of imperfect recall games is limited due to negative…

Computer Science and Game Theory · Computer Science 2017-05-25 Branislav Bosansky , Jiri Cermak , Karel Horak , Michal Pechoucek

Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is not known by other agents, nor is it known by the mechanism…

Computer Science and Game Theory · Computer Science 2012-07-19 Nathanael Hyafil , Craig Boutilier

We present a novel parameterized 4-qubit Eisert-Wilkens-Lewenstein (EWL) quantum game circuit for recommender systems in quadruple helix innovation ecosystems (academia, industry, government, and civil society). The local strategy operators…

Quantum Physics · Physics 2026-05-19 Agung Trisetyarso , Fithra Faisal Hastiadi , Kridanto Surendro
‹ Prev 1 2 3 10 Next ›