English
Related papers

Related papers: Strategic Argumentation is NP-Complete

200 papers

Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…

Chaotic Dynamics · Physics 2011-09-22 Tobias Galla , J. Doyne Farmer

Game logic is a dynamic modal logic which models strategic two person games; it contains propositional dynamic logic (PDL) as a fragment. We propose an interpretation of game logic based on stochastic effectivity functions. A definition of…

Logic in Computer Science · Computer Science 2014-04-01 Ernst-Erich Doberkat

Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium.…

Computer Science and Game Theory · Computer Science 2007-12-11 Stéphane Le Roux

Game theory provides a framework for studying communication dynamics and emergent phenomena arising from rational agent interactions. We present a model framework for the Volunteer's Dilemma with four key contributions: (1) formulating it…

Multiagent Systems · Computer Science 2025-09-24 Jacob Dineen , A S M Ahsan-Ul Haque , Matthew Bielskas

In this paper, we give a formal definition of the popular word-guessing game Wordle. We show that, in general, determining if a given Wordle instance admits a winning strategy is NP-complete. We also show that given a Wordle instance of…

Computational Complexity · Computer Science 2022-04-11 Will Rosenbaum

Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One…

Logic in Computer Science · Computer Science 2008-12-18 Samuel Mimram

This work presents a requirement analysis for collaborative dialogues among medical experts and an inquiry dialogue game based on this analysis for incorporating explainability into multiagent system design. The game allows experts with…

Multiagent Systems · Computer Science 2025-11-04 Qurat-ul-ain Shaheen , Katarzyna Budzynska , Carles Sierra

We consider deterministic totally-ordered-time games. We present three axioms for strategies. We show that for any tuple of strategies that satisfy the axioms, there exists a unique complete history that is consistent with the strategy…

Theoretical Economics · Economics 2022-11-08 Tomohiko Kawamori

There are multiple notions of coalitional responsibility. The focus of this paper is on the blameworthiness defined through the principle of alternative possibilities: a coalition is blamable for a statement if the statement is true, but…

Artificial Intelligence · Computer Science 2018-11-08 Pavel Naumov , Jia Tao

Collaboration is an integral part of human dialogue. Typical task-oriented dialogue games assign asymmetric roles to the participants, which limits their ability to elicit naturalistic role-taking in collaboration and its negotiation. We…

Computation and Language · Computer Science 2025-05-22 Isidora Jeknić , David Schlangen , Alexander Koller

We investigate uniformity properties of strategies. These properties involve sets of plays in order to express useful constraints on strategies that are not \mu-calculus definable. Typically, we can state that a strategy is…

Computer Science and Game Theory · Computer Science 2013-03-05 Bastien Maubert , Sophie Pinchinat , Laura Bozzelli

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

Logic in Computer Science · Computer Science 2022-06-02 Robert Freiman

Automation of dialogue system evaluation is a driving force for the efficient development of dialogue systems. This paper introduces the bipartite-play method, a dialogue collection method for automating dialogue system evaluation. It…

Computation and Language · Computer Science 2022-11-22 Shiki Sato , Yosuke Kishinami , Hiroaki Sugiyama , Reina Akama , Ryoko Tokuhisa , Jun Suzuki

Dialogue agents that support human users in solving complex tasks have received much attention recently. Many such tasks are NP-hard optimization problems that require careful collaborative exploration of the solution space. We introduce a…

Computation and Language · Computer Science 2026-01-09 Isidora Jeknic , Alex Duchnowski , Alexander Koller

Game theory is a powerful framework for reasoning about strategic interactions, with applications in domains ranging from day-to-day life to international politics. However, applying formal reasoning tools in such contexts is challenging,…

Artificial Intelligence · Computer Science 2024-10-15 Agnieszka Mensfelt , Kostas Stathis , Vince Trencsenyi

We propose a two-agent game wherein a questioner must be able to conjure discerning questions between sentences, incorporate responses from an answerer, and keep track of a hypothesis state. The questioner must be able to understand the…

Computation and Language · Computer Science 2019-08-14 Peter Potash , Kaheer Suleman

A discourse strategy is a strategy for communicating with another agent. Designing effective dialogue systems requires designing agents that can choose among discourse strategies. We claim that the design of effective strategies must take…

cmp-lg · Computer Science 2016-08-31 Marilyn A. Walker

Propositional Dynamic Logic or PDL was invented as a logic for reasoning about regular programming constructs. We propose a new perspective on PDL as a multi-agent strategic logic (MASL). This logic for strategic reasoning has group…

Computer Science and Game Theory · Computer Science 2013-10-28 Jan van Eijck

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

We consider an extension of strategic normal form games with a phase before the actual play of the game, where players can make binding offers for transfer of utilities to other players after the play of the game, contingent on the…

Computer Science and Game Theory · Computer Science 2013-11-19 Valentin Goranko , Paolo Turrini