Imagen de Portada

A two-player version of the assignment problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Galliot, Florian, Oijid, Nacim, Sénizergues, Jonas
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Computational Complexity Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Maker-Maker games of rank 4 are PSPACE-complete
por: Galliot, Florian, et al.
Publicado: (2025)

Poset Positional Games
por: Bagan, Guillaume, et al.
Publicado: (2024)

Bounded degree QBF and positional games
por: Oijid, Nacim
Publicado: (2024)

On the complexity of the Maker-Breaker happy vertex game
por: Hilaire, Mathieu, et al.
Publicado: (2026)

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
por: Galliot, Florian
Publicado: (2025)

On the parameterized complexity of the Maker-Breaker domination game
por: Bagan, Guillaume, et al.
Publicado: (2026)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

A unified convention for achievement positional games
por: Galliot, Florian, et al.
Publicado: (2025)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
por: Marcille, Clara, et al.
Publicado: (2026)

Token positional games
por: Bagan, Guillaume, et al.
Publicado: (2026)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
por: Mauras, Simon, et al.
Publicado: (2025)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
por: Takazawa, Kenjiro
Publicado: (2024)

Matroids are Equitable
por: Akrami, Hannaneh, et al.
Publicado: (2025)

Asynchronous Majority Dynamics on Binomial Random Graphs
por: Mohan, Divyarthi, et al.
Publicado: (2023)

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
por: Kanaya, Yuga, et al.
Publicado: (2025)

Quantifying Core Stability Relaxations in Hedonic Games
por: Demeulemeester, Tom, et al.
Publicado: (2024)

Discrepancy Beyond Additive Functions with Applications to Fair Division
por: Hollender, Alexandros, et al.
Publicado: (2025)

Thinned Quantile Shares are Universally Feasible
por: Jain, Vishesh, et al.
Publicado: (2026)

Exact number of flips required to sort a burnt stack of pancakes
por: Jäger, Gerold, et al.
Publicado: (2026)

Winning in the Limit: Average-Case Committee Selection with Many Candidates
por: Lin, Yifan, et al.
Publicado: (2026)

On complete classes of valuated matroids
por: Husić, Edin, et al.
Publicado: (2021)

Algorithmic methods of finite discrete structures. Graph clique problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
por: Le, Hoang-Oanh, et al.
Publicado: (2023)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
por: Takazawa, Kenjiro
Publicado: (2024)

Stationary Online Contention Resolution Schemes
por: Aminian, Mohammad Reza, et al.
Publicado: (2026)

Six Candidates Suffice to Win a Voter Majority
por: Charikar, Moses, et al.
Publicado: (2024)

The Popular Dimension of Matchings
por: Connor, Frank, et al.
Publicado: (2025)

Approximately Dominating Sets in Elections
por: Charikar, Moses, et al.
Publicado: (2025)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
por: Burke, Kyle, et al.
Publicado: (2024)

A Classification of Long-Refinement Graphs for Colour Refinement
por: Kiefer, Sandra, et al.
Publicado: (2025)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
por: Seppelt, Tim
Publicado: (2024)

Restricted CSPs and F-free Digraph Algorithmics
por: Guzmán-Pro, Santiago, et al.
Publicado: (2025)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
por: Seppelt, Tim
Publicado: (2023)

The Richness of CSP Non-redundancy
por: Brakensiek, Joshua, et al.
Publicado: (2025)

A Linear Kernel for Planar Vector Domination
por: Sahili, Mahabba El, et al.
Publicado: (2023)

A Simple Sub-Polynomial Degree Coboundary Expander
por: Hopkins, Max, et al.
Publicado: (2026)

A structural description of Zykov and Blanche Descartes graphs
por: Marin, Malory, et al.
Publicado: (2024)

Combinatorial Bernoulli Factories
por: Niazadeh, Rad, et al.
Publicado: (2020)

Determining the Outerthickness of Graphs Is NP-Hard
por: Lee, Pin-Hsian, et al.
Publicado: (2026)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)