A Monte Carlo algorithm for a lottery problem

DOI10.1515/MCMA.2001.7.1-2.73MaRDI QIDQ2724981zbMATH OpenOpenAlexFDO

Authors Mark Braverman, Shay Gueron

Publication date 12 July 2001

Published in Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/mcma.2001.7.1-2.73

zbMATH Keywords

correct matcheslottery problemMonte Carlo algorithm

Mathematics Subject Classification ID

Combinatorial games (91A46)

Recommendations

• The Monte Carlo Algorithm with a Pseudorandom Generator
• An Optimal Algorithm for Monte Carlo Estimation
• scientific article; zbMATH DE number 1286253
• scientific article; zbMATH DE number 1163490
• An analysis of Monte Carlo algorithms for counting problems
• Monte-Carlo approximation algorithms for enumeration problems
• Probabilistic-algebraic algorithms of Monte Carlo methods
• scientific article; zbMATH DE number 854710
• scientific article; zbMATH DE number 3954144

Cited in

(5)

• Monte Carlo approaches to parameterized poker squares
• A note on a symmetrical set covering problem: the lottery problem
• Two combinatorial problems involving lottery schemes: algorithmic determination of solution sets
• The Monte Carlo Algorithm with a Pseudorandom Generator
• scientific article; zbMATH DE number 874564 (Why is no real title available?)

This page was built for publication: A Monte Carlo algorithm for a lottery problem

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