Image de couverture de livre

An NP-hard generalization of Nim

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Liu, Chunlei
Format:	Preprint
Publié:	2024
Sujets:	Computer Science and Game Theory Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

StrNim: a variant of Nim played on strings
par: Mizuno, Shota, et autres
Publié: (2025)

Misère Greedy Nim and Misère Bounded Greedy Nim
par: Omiya, Nanako, et autres
Publié: (2025)

On the structure of EFX orientations on graphs
par: Zeng, Jinghan A, et autres
Publié: (2024)

Relationship between misère NIM and two-player GOISHI HIROI
par: Abuku, Tomoaki, et autres
Publié: (2024)

Edge-dominance games on graphs
par: Arthaud, Farid, et autres
Publié: (2024)

So Long Sucker: Endgame Analysis
par: De Carufel, Jean-Lou, et autres
Publié: (2024)

Cost Allocation for Set Covering: the Happy Nucleolus
par: Blauth, Jannis, et autres
Publié: (2024)

von Neumann and Newman Pokers with Finite Decks
par: Krityakierne, Tipaluck, et autres
Publié: (2024)

Misere Connect Four is Solved
par: Steele, Robert, et autres
Publié: (2024)

Perpetually Fair Assignments Via Balanced Sequences of Permutations
par: Adams, Terrence, et autres
Publié: (2026)

Connectedness in weighted consensus division of graphical cakes between two agents
par: Hanke, Josef, et autres
Publié: (2023)

Achieving the Highest Possible Elo Rating
par: Shah, Rikhav
Publié: (2022)

An upper bound for the number of chess diagrams without promotion
par: Gourion, Daniel
Publié: (2021)

A few good choices
par: Nguyen, Thanh, et autres
Publié: (2025)

A Linear Programming Approach to the Super-Stable Roommates Problem
par: Kamiyama, Naoyuki
Publié: (2025)

Nucleolus, Happy Nucleolus, and Vehicle Routing
par: Ebert, Daniel, et autres
Publié: (2025)

Cycle Patterns and Mean Payoff Games
par: Loho, Georg, et autres
Publié: (2025)

Classification aggregation: a quantitative impossibility theorem
par: Filmus, Yuval
Publié: (2026)

Matroids are Equitable
par: Akrami, Hannaneh, et autres
Publié: (2025)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
par: Takazawa, Kenjiro
Publié: (2024)

Poset Positional Games
par: Bagan, Guillaume, et autres
Publié: (2024)

Quantifying Core Stability Relaxations in Hedonic Games
par: Demeulemeester, Tom, et autres
Publié: (2024)

Stable Menus of Public Goods: A Matching Problem
par: Fish, Sara, et autres
Publié: (2024)

Dynamics of multidimensional Simple Clock Auctions
par: Zeroual, Jad, et autres
Publié: (2025)

Game Connectivity and Adaptive Dynamics
par: Johnston, Tom, et autres
Publié: (2023)

Asynchronous Majority Dynamics on Binomial Random Graphs
par: Mohan, Divyarthi, et autres
Publié: (2023)

Between proportionnality and envy-freeness: k-proportionality
par: Chèze, Guillaume
Publié: (2025)

On Connected Strongly-Proportional Cake-Cutting
par: Jankó, Zsuzsanna, et autres
Publié: (2023)

Game connectivity and adaptive dynamics in many-action games
par: Johnston, Tom, et autres
Publié: (2026)

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
par: Kanaya, Yuga, et autres
Publié: (2025)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
par: Mauras, Simon, et autres
Publié: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
par: Hollender, Alexandros, et autres
Publié: (2025)

NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations
par: Bebchuk, Alon
Publié: (2025)

Thinned Quantile Shares are Universally Feasible
par: Jain, Vishesh, et autres
Publié: (2026)

Cooking Poisons: Thinking Laterally with Game Theory
par: Chow, Timothy Y.
Publié: (2024)

Hiring Strategies
par: Krapivsky, P. L.
Publié: (2024)

A new approach to bipartite stable matching optimization
par: Fleiner, Tamás, et autres
Publié: (2024)

PackIt! Gamified Rectangle Packing
par: Garrison, Thomas, et autres
Publié: (2024)

Stake-governed tug-of-war and the biased infinity Laplacian
par: Fu, Yujie, et autres
Publié: (2022)

Optimal strategy in the game Risk or Safety
par: Jehn, Rüdiger
Publié: (2026)