The following pages link to On a combinatorial game (Q5905678):
Displayed 50 items.
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Maker-breaker domination number (Q2317950) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Rectangular polyomino set weak \((1,2)\)-achievement games (Q2378512) (← links)
- Strong Ramsey games: drawing on an infinite board (Q2397109) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- Bases for equational theories of semi-groups (Q2536632) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- On the biased \(n\)-in-a-row game (Q2581405) (← links)
- The threshold bias of the clique-factor game (Q2664555) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation (Q2685699) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
- A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158) (← links)
- On the threshold for the Maker-Breaker<i>H</i>-game (Q2830239) (← links)
- Hitting time results for Maker-Breaker games (Q2909241) (← links)
- Walker-Breaker Games (Q2944455) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- On Ramsey-type positional games (Q3057062) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- Ramsey, Paper, Scissors (Q3386531) (← links)
- Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)
- Winning Fast in Sparse Graph Construction Games (Q3608334) (← links)
- Remarks on positional games. I (Q3663044) (← links)
- The 𝑞-regularity of lattice point paths in 𝑅ⁿ (Q4065551) (← links)
- Discrete threshold growth dynamics are omnivorous for box neighborhoods (Q4226658) (← links)
- Deterministic Graph Games and a Probabilistic Intuition (Q4306428) (← links)
- The Maker--Breaker Rado Game on a Random Set of Integers (Q4646256) (← links)
- A Winning Strategy for the Ramsey Graph Game (Q4715271) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- Maker–Breaker percolation games I: crossing grids (Q4993258) (← links)
- Tic-Tac-Toe on an Affine Plane of order 4 (Q5080903) (← links)
- Technical Note—Assortment Optimization with Small Consideration Sets (Q5129194) (← links)
- The Random Graph Intuition for the Tournament Game (Q5364264) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
- (Q5384204) (← links)
- Robust Hamiltonicity of Dirac graphs (Q5420107) (← links)
- (Q5743497) (← links)
- Chasing the Threshold Bias of the 3-AP Game (Q5869447) (← links)