On Ruckle's Conjecture on Accumulation Games

DOI10.1137/080741926MaRDI QIDQ3083256zbMATH OpenOpenAlexWikidataFDO

Authors Ken Kikuta, Steve Alpern, Robbert Fokkink

Publication date 21 March 2011

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080741926

zbMATH Keywords

tail probabilityoptimal strategyintersecting familyaccumulation game

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 2-person games (91A05) Combinatorial games (91A46)

Recommendations

• Accumulation games on graphs
• On a ruckle problem in discrete games of ambush
• A generalization of Ruckle's results for an ambush game
• On Rall's 1/2-conjecture on the domination game
• Game-theoretical aspects of the Borel conjecture
• On \(\alpha\)-constant-sum games
• Zero-sum dynamic games and a stochastic variation of Ramsey's theorem
• New results on a Ruckle problem in discrete games of ambush

Cited in

(7)

• Accumulation games on graphs
• A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
• On Rall's 1/2-conjecture on the domination game
• The solution to an open problem for a caching game
• A Caching Game with Infinitely Divisible Hidden Material
• How to Poison Your Mother-in-Law, and Other Caching Problems
• Static search games played over graphs and general metric spaces

This page was built for publication: On Ruckle's Conjecture on Accumulation Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083256)