Modern applications of 'division of stakes' theorem ?

AI Thread Summary
The discussion centers on the application of the 'division of stakes' theorem, which addresses how to fairly divide a prize pot when a game is interrupted before a winner is determined. The original problem involves two players with equal chances of winning rounds and how to resolve the outcome if the game is halted. One modern example mentioned is One Day Cricket, where the Duckworth-Lewis system is used to recalculate winning conditions if a match is rained off. The conversation seeks to identify other contemporary games or sports that might utilize similar principles for determining outcomes when a game cannot be completed. Overall, the thread explores the relevance of historical mathematical theories in today's gaming scenarios.
sab456
Messages
1
Reaction score
0
Hello folks,

I am new to this forum.

I am trying to find out which modern day games or sports apply the 'division of stakes' or 'problem of points' ?

A brief description of 'division of stakes' is as follows

The problem concerns a game of chance with two players who have equal chances of winning each round. The players contribute equally to a prize pot, and agree in advance that the first player to have won a certain number of rounds will collect the entire prize. Now suppose that the game is interrupted by external circumstances before either player has achieved victory. How does one then divide the pot fairly?

Pascal, Chevalier de Méré, Fermat among many others proposed their own distinct ideas to this problem.

Would you know any modern day games that would have a scenario where a certain number of rounds are to be won and if none of the teams achieve it, how is the outcome determined ?

Many thanks.
 
Physics news on Phys.org
A game where this sort of decision comes up is One Day Cricket. If the game is rained off for example, they often use the Duckworth-Lewis system for re-calculating what it takes to win. This isn't quite your scenario but might provide some hints.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top