:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Brand, Cornelius, Ganian, Robert, Kalyanasundaram, Subrahmanyam, Inerney, Fionn Mc
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Artificial Intelligence Computational Complexity
Online Access:	https://arxiv.org/abs/2312.10219
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Structural Complexity Analysis of Hierarchical Task Network Planning
by: Brand, Cornelius, et al.
Published: (2024)

Multiwinner Temporal Voting with Aversion to Change
by: Zech, Valentin, et al.
Published: (2024)

Higher-Order Responsibility
by: Jiang, Junli, et al.
Published: (2025)

Parameterized Complexity of Caching in Networks
by: Ganian, Robert, et al.
Published: (2024)

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

The Complexity of Min-Max Optimization with Product Constraints
by: Bernasconi, Martino, et al.
Published: (2026)

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

Intrinsic Barriers and Practical Pathways for Human-AI Alignment: An Agreement-Based Complexity Analysis
by: Nayebi, Aran
Published: (2025)

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

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

On the Complexity of Learning Nash Equilibria
by: Biggar, Oliver, et al.
Published: (2026)

The Computational Complexity of the Housing Market
by: Lock, Edwin, et al.
Published: (2024)

On the Smoothed Complexity of Combinatorial Local Search
by: Giannakopoulos, Yiannis, et al.
Published: (2022)

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

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

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

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
by: Aziz, Haris, et al.
Published: (2024)

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

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
by: Brânzei, Simina, et al.
Published: (2024)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
by: Bernasconi, Martino, et al.
Published: (2024)

Computing Equilibrium beyond Unilateral Deviation
by: Liu, Mingyang, et al.
Published: (2026)

Core Safety Values for Provably Corrigible Agents
by: Nayebi, Aran
Published: (2025)

Makespan Minimization in Split Learning: From Theory to Practice
by: Ganian, Robert, et al.
Published: (2026)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
by: Li, Zihan, et al.
Published: (2024)

Inequality in Congestion Games with Learning Agents
by: Michailidis, Dimitris, et al.
Published: (2026)

How to Resolve Envy by Adding Goods
by: Bentert, Matthias, et al.
Published: (2025)

Human-in-the-loop Learning for Dynamic Congestion Games
by: Li, Hongbo, et al.
Published: (2024)

To Analyze and Regulate Human-in-the-loop Learning for Congestion Games
by: Li, Hongbo, et al.
Published: (2025)

Complexity of Stability in Trading Networks
by: Fleiner, Tamás, et al.
Published: (2018)

Structural Complexities of Matching Mechanisms
by: Gonczarowski, Yannai A., et al.
Published: (2022)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
by: Ganian, Robert, et al.
Published: (2025)

Mathematical Modelling of Ethical AI Use in Higher Education: A Coordination Game Framework for Future-Facing Learning
by: Ogbo, Ndidi Bianca, et al.
Published: (2026)

Computational Social Choice: Parameterized Complexity and Challenges
by: Chen, Jiehua, et al.
Published: (2024)

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

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters
by: Colley, Rachael, et al.
Published: (2025)

Spatial Voting with Incomplete Voter Information
by: Imber, Aviram, et al.
Published: (2023)

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

Constant Inapproximability for Fisher Markets
by: Deligkas, Argyrios, et al.
Published: (2026)