Cover Image

Simple Stochastic Stopping Games: A Generator and Benchmark Library

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rudich, Avi, Rudich, Isaac, Rue, Rachel
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Computer Science and Game Theory F.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
by: Cheval, Vincent, et al.
Published: (2025)

Complexity of Unambiguous Problems in $Σ^P_2$
by: Gilboa, Matan, et al.
Published: (2025)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework
by: Luberisse, Joshua
Published: (2025)

The Computational Complexity of Variational Inequalities and Applications in Game Theory
by: Kapron, Bruce M., et al.
Published: (2024)

The Degree of Fairness in Efficient House Allocation
by: Hosseini, Hadi, et al.
Published: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
by: Hansen, Kristoffer Arnsfelt, et al.
Published: (2025)

A Characterization of Complexity in Public Goods Games
by: Gilboa, Matan
Published: (2023)

Structure-Guided Automated Reasoning
by: Bannach, Max, et al.
Published: (2023)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
by: Bredereck, Robert, et al.
Published: (2024)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)

Tight Inapproximability of Nash Equilibria in Public Goods Games
by: Dinh, Jérémi Do, et al.
Published: (2024)

The Complexity of Strategic Behavior in Primary Elections
by: Cleveland, Colin, et al.
Published: (2026)

Modelling Network Resilience: The Complexity of Some Graph Division Games
by: Gutowski, Grzegorz, et al.
Published: (2026)

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
by: Bhaskar, Umang, et al.
Published: (2024)

Equilibrium Computation in the Hotelling-Downs Model of Spatial Competition
by: Bhaskar, Umang, et al.
Published: (2024)

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
by: Caragiannis, Ioannis, et al.
Published: (2024)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
by: Rothe, Jörg, et al.
Published: (2025)

Constructibility and the P versus NP problem
by: Hole, Arne
Published: (2024)

When Simple is Near Optimal in Security Games
by: Jalota, Devansh, et al.
Published: (2024)

Computation as a Game
by: Bilokon, Paul Alexander
Published: (2025)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
by: Kaczmarek, Joanna, et al.
Published: (2024)

Graph-Based Deterministic Polynomial Framwork for NP Problems
by: Lee, Changryeol
Published: (2025)

Nonuniform Deterministic Finite Automata over finite algebraic structures
by: Idziak, Paweł M., et al.
Published: (2025)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
by: Chen, Yanlin, et al.
Published: (2023)

Search versus Search for Collapsing Electoral Control Types
by: Carleton, Benjamin, et al.
Published: (2022)

Anyone but Him: The Complexity of Precluding an Alternative
by: Hemaspaandra, Edith, et al.
Published: (2005)

Fair Interventions in Weighted Congestion Games
by: Fischer, Miriam, et al.
Published: (2023)

The Complexity of Sparse Win-Lose Bimatrix Games
by: Batziou, Eleni, et al.
Published: (2026)

Low communication protocols for fair allocation of indivisible goods
by: Feige, Uriel
Published: (2024)

On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
by: Lin, Chuang-Chieh, et al.
Published: (2023)

Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
by: Hanaka, Tesshu, et al.
Published: (2026)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

Choosing What Game to Play without Selecting Equilibria: Inferring Safe (Pareto) Improvements in Binary Constraint Structures
by: Oesterheld, Caspar, et al.
Published: (2025)

Smoothed analysis of deterministic discounted and mean-payoff games
by: Loff, Bruno, et al.
Published: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
by: D'Amico-Wong, Luca, et al.
Published: (2024)