You are not currently logged in.
Access JSTOR through your library or other institution:
Winning a Pool Is Harder Than You Thought
John P. Bonomo
The College Mathematics Journal
Vol. 47, No. 5 (November 2016), pp. 347-355
Published by: Mathematical Association of America
Stable URL: http://www.jstor.org/stable/10.4169/college.math.j.47.5.347
Page Count: 9
You can always find the topics here!Topics: Games, Mathematical problems, Polynomials, Betting, Bowls, Triangles, College mathematics, Mathematical expressions, Algorithms, Computer science
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This article address the question of whether or not it is possible to know if you are mathematically eliminated from a type of betting pool known as a confidence pool. We show that this problem falls in the category of NP-complete problems, meaning that there is almost surely no quick method to determine the answer.
Copyright 2016 The Mathematical Association of America