Image de couverture de livre

Complexity of Unambiguous Problems in $Σ^P_2$

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gilboa, Matan, Goldberg, Paul W., Koutsoupias, Elias, Nisan, Noam
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity Computer Science and Game Theory F.2; F.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
par: Cheval, Vincent, et autres
Publié: (2025)

Simple Stochastic Stopping Games: A Generator and Benchmark Library
par: Rudich, Avi, et autres
Publié: (2024)

A Characterization of Complexity in Public Goods Games
par: Gilboa, Matan
Publié: (2023)

The Complexity of Graph Exploration Games
par: Fuchs, Janosch, et autres
Publié: (2023)

Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework
par: Luberisse, Joshua
Publié: (2025)

Learning to Maximize Gains From Trade in Small Markets
par: Babaioff, Moshe, et autres
Publié: (2024)

The Computational Complexity of Variational Inequalities and Applications in Game Theory
par: Kapron, Bruce M., et autres
Publié: (2024)

The Complexity of Strategic Behavior in Primary Elections
par: Cleveland, Colin, et autres
Publié: (2026)

Anyone but Him: The Complexity of Precluding an Alternative
par: Hemaspaandra, Edith, et autres
Publié: (2005)

A Note On The Natural Range Of Unambiguous-SAT
par: Pay, Tayfun
Publié: (2023)

Constructibility and the P versus NP problem
par: Hole, Arne
Publié: (2024)

Search versus Search for Collapsing Electoral Control Types
par: Carleton, Benjamin, et autres
Publié: (2022)

The Degree of Fairness in Efficient House Allocation
par: Hosseini, Hadi, et autres
Publié: (2024)

Graph-Based Deterministic Polynomial Framwork for NP Problems
par: Lee, Changryeol
Publié: (2025)

Low communication protocols for fair allocation of indivisible goods
par: Feige, Uriel
Publié: (2024)

Computation as a Game
par: Bilokon, Paul Alexander
Publié: (2025)

Structure-Guided Automated Reasoning
par: Bannach, Max, et autres
Publié: (2023)

Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games
par: Bullinger, Martin, et autres
Publié: (2024)

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
par: Caragiannis, Ioannis, et autres
Publié: (2024)

Designing Rules for Choosing a Winner in a Debate
par: Heckett, Alexander, et autres
Publié: (2025)

Matching Markets with Chores
par: Garg, Jugal, et autres
Publié: (2024)

Bribery Can Get Harder in Structured Multiwinner Approval Election
par: Kusek, Bartosz, et autres
Publié: (2022)

Matroid Bayesian Online Selection
par: DeHaan, Ian, et autres
Publié: (2024)

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
par: Sun, Ankang, et autres
Publié: (2024)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
par: Li, Bo, et autres
Publié: (2024)

A Note on the NP-Hardness of PARTITION Via First-Order Projections
par: Iturralde, Paúl Risco
Publié: (2025)

New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
par: Fan, Austen, et autres
Publié: (2026)

Coverage Games
par: Kupferman, Orna, et autres
Publié: (2026)

Nonuniform Deterministic Finite Automata over finite algebraic structures
par: Idziak, Paweł M., et autres
Publié: (2025)

On the Welfare of EIP-1559 with Patient Bidders
par: Babaioff, Moshe, et autres
Publié: (2025)

Domination-Avoiding Learning Agents Cannot Collude
par: Nisan, Noam, et autres
Publié: (2026)

Consumable Data via Quantum Communication
par: Gilboa, Dar, et autres
Publié: (2024)

On the formalization of the notion of a concurrent algorithm
par: Middelburg, C. A.
Publié: (2024)

Formalizing the notions of non-interactive and interactive algorithms
par: Middelburg, C. A.
Publié: (2024)

Zero Carbon V2X Tariffs for Non-Domestic Customers
par: Shamash, Elisheva S, et autres
Publié: (2025)

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
par: Bhaskar, Umang, et autres
Publié: (2024)

Equilibrium Computation in the Hotelling-Downs Model of Spatial Competition
par: Bhaskar, Umang, et autres
Publié: (2024)

Reactive Synthesis for Expected Impacts
par: Chini, Emanuele, et autres
Publié: (2024)

Two-player Domino games
par: de Menibus, Benjamin Hellouin, et autres
Publié: (2023)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
par: Kazakov, Yevgeny, et autres
Publié: (2009)