Cover Image

Poset Positional Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bagan, Guillaume, Duchêne, Eric, Galliot, Florian, Gledel, Valentin, Mikalački, Mirjana, Oijid, Nacim, Parreau, Aline, Stojaković, Miloš
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Token positional games
by: Bagan, Guillaume, et al.
Published: (2026)

A two-player version of the assignment problem
by: Galliot, Florian, et al.
Published: (2026)

The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)

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

Partition strategies for the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2024)

Positional s-of-k games
by: Duchêne, Eric, et al.
Published: (2026)

Complexity of Maker-Breaker Games on Edge Sets of Graphs
by: Duchêne, Eric, et al.
Published: (2023)

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

Bounded degree QBF and positional games
by: Oijid, Nacim
Published: (2024)

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

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

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

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

Matroids are Equitable
by: Akrami, Hannaneh, et al.
Published: (2025)

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

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

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

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

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

An Algorithm for the Assignment Game Beyond Additive Valuations
by: Balkanski, Eric, et al.
Published: (2024)

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

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

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

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

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

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

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

Static Nuel Games with Terminal Payoff
by: Mastrakoulis, S., et al.
Published: (2024)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Nonatomic Non-Cooperative Neighbourhood Balancing Games
by: Auger, David, et al.
Published: (2023)

Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
by: Beaudou, Laurent, et al.
Published: (2016)

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

The Popular Dimension of Matchings
by: Connor, Frank, et al.
Published: (2025)

Approximately Dominating Sets in Elections
by: Charikar, Moses, et al.
Published: (2025)

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

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2022)

Generalized saturation game
by: Patkós, Balázs, et al.
Published: (2024)

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

Graph Irregularity via Edge Deletions
by: Bensmail, Julien, et al.
Published: (2025)