The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games [PDF]
Logical Methods in Computer Science, 2020 We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible.
Thomas Brihaye +4 more
doaj +7 more sources
Subgame-perfect Equilibria in Mean-payoff Games (journal version) [PDF]
Logical Methods in Computer Science, 2023 In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives.
Léonard Brice +2 more
doaj +7 more sources
Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games [PDF]
Games, 2017 This paper examines how to construct subgame-perfect mixed-strategy equilibria in discounted repeated games with perfect monitoring. We introduce a relatively simple class of strategy profiles that are easy to compute and may give rise to a large set of ...
Kimmo Berg, Gijs Schoenmakers
doaj +3 more sources
Infinite subgame perfect equilibrium in the Hausdorff difference hierarchy [PDF]
International Conference on Topics in Theoretical Computer Science, 2015 Subgame perfect equilibria are specific Nash equilibria in perfect information games in extensive form. They are important because they relate to the rationality of the players. They always exist in infinite games with continuous real-valued payoffs, but
Stéphane Le Roux
core +8 more sources
A Marriage between Adversarial Team Games and 2-player Games: Enabling Abstractions, No-regret Learning, and Subgame Solving [PDF]
International Conference on Machine Learning, 2022 \emph{Ex ante} correlation is becoming the mainstream approach for \emph{sequential adversarial team games}, where a team of players faces another team in a zero-sum game.
Luca Carminati +3 more
openalex +3 more sources
Subgame Consistent Cooperative Behavior in an Extensive form Game with Chance Moves
Mathematics, 2020 We design a mechanism of the players’ sustainable cooperation in multistage n-person game in the extensive form with chance moves. When the players agreed to cooperate in a dynamic game they have to ensure time consistency of the long-term cooperative ...
Denis Kuzyutin, Nadezhda Smirnova
doaj +2 more sources
Alternating-Offers Bargaining with Nash Bargaining Fairness Concerns [PDF]
Behavioral Sciences, 2023 The Rubinstein alternating-offers bargaining game is reconsidered, where players show fairness concerns and their fairness references are characterized by the Nash bargaining solution.
Zhongwei Feng, Fangning Li, Chunqiao Tan
doaj +2 more sources
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notions of Nash equilibrium (NE) and subgame perfect equilibrium (SPE), we ...
Thomas Brihaye +3 more
doaj +3 more sources
Subgame Maxmin Strategies in Zero-Sum Stochastic Games with Tolerance Levels [PDF]
Dynamic Games and Applications, 2021 We study subgame ϕ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$
János Flesch +3 more
openalex +2 more sources
Subgame Perfect Equilibrium in the Rubinstein Bargaining Game with Loss Aversion
Complexity, 2019 Rubinstein bargaining game is extended to incorporate loss aversion, where the initial reference points are not zero. Under the assumption that the highest rejected proposal of the opponent last periods is regarded as the associated reference point, we ...
Zhongwei Feng, Chunqiao Tan
doaj +2 more sources