The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Filters
Rigorous computer analysis of the Chow-Robbins game
[article]
2012
arXiv
pre-print
We establish a simple upper bound on the expected payoff in a given position, allowing efficient and rigorous computer analysis of positions early in the game. ...
This so-called Chow-Robbins game is amenable to computer analysis, but while simple-minded number crunching can show that it is best to continue in a given position, establishing rigorously that stopping ...
The Chow-Robbins game The following game was introduced by Yuan-Shih Chow and Herbert Robbins [1] in 1964: We toss a coin repeatedly, and stop whenever we want. ...
arXiv:1201.0626v1
fatcat:e2qunkxg5vdgdonvgnwd44djvq
Rigorous Computer Analysis of the Chow–Robbins Game
2013
The American mathematical monthly
We establish a simple upper bound on the expected payoff in a given position, allowing efficient and rigorous computer analysis of positions early in the game. ...
This so-called Chow-Robbins game is amenable to computer analysis, but while simple-minded number crunching can show that it is best to continue in a given position, establishing rigorously that stopping ...
The Chow-Robbins game The following game was introduced by Yuan-Shih Chow and Herbert Robbins [1] in 1964: We toss a coin repeatedly, and stop whenever we want. ...
doi:10.4169/amer.math.monthly.120.10.893
fatcat:duqwtrvrsbbpthbydq242jlgea
On the Sn/n-Problem
[article]
2021
arXiv
pre-print
The Chow-Robbins game is a classical still partly unsolved stopping problem introduced by Chow and Robbins in 1965. You repeatedly toss a fair coin. ...
For the Chow-Robbins game we as well give a tight lower bound and use these to calculate, on the integers, the complete continuation and the stopping set of the problem for n≤ 10^5. ...
We use T = 10 6 to calculate V (0, 0) and the integer thresholdsb(n) := b(n) . For 34 values n ≤ 10 6 the exact valueb(n) can not be determined this way, the smallest such value is n = 489.242. ...
arXiv:1909.05762v3
fatcat:dg33ozr3jvcohbjmkohrq5s3ua
An Experimental Mathematics Perspective on the Old, and still Open, Question of When To Stop?
[article]
2010
arXiv
pre-print
In a recent article in American Scientist, Theodore Hill described a coin-tossing game whose pay-off is the number of heads over the total number of throws. ...
In the present article, we explore different strategies to this game from the Experimental Mathematics perspective. ...
The work of the second author was supported in part by the USA National Science Foundation. July 23, 2009 ...
arXiv:0907.0032v2
fatcat:csdo4laaebhtzkv3w6eaor2fei
Adaptive Trade-Offs in Off-Policy Learning
[article]
2020
arXiv
pre-print
A great variety of off-policy learning algorithms exist in the literature, and new breakthroughs in this area continue to be made, improving theoretical understanding and yielding state-of-the-art reinforcement ...
We develop one such algorithm, C-trace, demonstrating that it is able to more efficiently make these trade-offs than existing methods in use, and that it can be scaled to yield state-of-the-art performance ...
Bilal Piot, Tom Schaul, and Yunhao Tang for interesting conversations during the course of this work. ...
arXiv:1910.07478v2
fatcat:a6677zj4pba5jo3ybeevcu6piy
Selected Papers
1985
Southern Journal of Agricultural Economics
"Total Factor Productivity and the Elasticity of Scale: An Analysis of U.S. Agriculture." Robbin Shoemaker, ERS, USDA. ...
"Grain Export Elevators: Economies of Size Analysis." Magid A. Dagher, University of Maryland; and Lynn W. Robbins, University of Kentucky. ...
Additionally, evaluation of the hypothesis that the 1975 frost in Brazil had resulted in structural changes in the international coffee economy was accepted, based on the Chow test. ...
doi:10.1017/s0081305200017210
fatcat:snlgoujopzhqnlnymbuklwmivm
Optimal Stopping Under Ambiguity
2006
Social Science Research Network
If, however, the class of priors is time-consistent, we establish a generalization of the classical theory of optimal stopping. ...
We solve two classes of examples: the so-called independent and indistinguishable case (the parking problem) and the case of American Options (Cox-Ross-Rubinstein model). ...
Having established these two key theorems, one can proceed as in the classical literature (Chow, Robbins, and Siegmund (1971) , Snell (1952) ). ...
doi:10.2139/ssrn.1013276
fatcat:2dngxujdpbd3zdph3537ewksku
The stochastic root-finding problem
2011
ACM Transactions on Modeling and Computer Simulation
The stochastic root-finding problem (SRFP) is that of finding the zero(s) of a vector function, that is, solving a nonlinear system of equations when the function is expressed implicitly through a stochastic ...
With a view towards helping the practitioner, we discuss specific variations in their implementable form, and provide references to computer code when easily available. ...
ACKNOWLEDGMENT We would like to thank the anonymous referees and the area editor for their thorough reviews and suggestions. ...
doi:10.1145/1921598.1921603
fatcat:kknmrtldejckfkhfcqopzeazme
Communication Technology Integration into Social Work Practice
2015
Advances in Social Work
As a result of this transformation, the use of technology has evolved in social work practice. ...
This article will examine a theoretically based direction for the future creation of technologically driven interventions in social work practice and address both the challenges and opportunities communication ...
Acknowledgements The author wishes to acknowledge the contribution of the participants in this research. ...
doi:10.18060/18259
fatcat:5ken5yjdcradjfunilejymmiky
Interpretable and Personalized Apprenticeship Scheduling: Learning Interpretable Scheduling Policies from Heterogeneous User Demonstrations
[article]
2021
arXiv
pre-print
inferred, personalized embedding non-parametric in the number of demonstrator types. ...
Due to the large-scale and dynamic nature of resource coordination in hospitals and factories, human domain experts manually plan and adjust schedules on the fly. ...
Machine learning techniques for analyzing
training behavior in serious gaming. IEEE Transactions on Computational Intelligence and AI in Games,
2017.
[18] Blake Griffin. ...
arXiv:1906.06397v5
fatcat:thqmemuqjzcpdifn36zow4n6he
The results also call for the inclusion of "out-of-system" situations in training.
KEY-WORDS: Performance Analysis. Social Network Analysis. Eigenvector. Game Complexes. ...
The system measures the relative position of the pupil and corneal reflection. The record process is done through transferred to a computer and analyzed by running Tobii Glasses Analysis Software. ...
doi:10.5628/rpcd.17.s1a.13
fatcat:fneu7bc3bncljpwpn6vju2og4m
Effective Policy Search Method for Robot Reinforcement Learning with Noisy Reward
노이즈 환경에서 효과적인 로봇 강화 학습의 정책 탐색 방법
2022
The Journal of Korea Robotics Society
노이즈 환경에서 효과적인 로봇 강화 학습의 정책 탐색 방법
We also wish to thank the many people who have read drafts of this book and provided valuable comments, including ...
, 1992; Doya, 1996) . 3 We use R t+1 instead of R t to denote the reward due to A t because it emphasizes that the next reward and next state, R t+1 and S t+1 , are jointly determined. ...
2 We restrict attention to discrete time to keep things as simple as possible, even though many of the ideas can be extended to the continuous-time case (e.g., see Bertsekas and Tsitsiklis, 1996; Werbos ...
doi:10.7746/jkros.2022.17.1.001
fatcat:r44kgqjsyrcq7pnyk4ylrwigwq
Robot Learning from Randomized Simulations: A Review
[article]
2021
arXiv
pre-print
The rise of deep learning has caused a paradigm shift in robotics research, favoring methods that require large amounts of data. ...
Therefore, state-of-the-art approaches learn in simulation where data generation is fast as well as inexpensive and subsequently transfer the knowledge to the real robot (sim-to-real). ...
This question relates to the problems of optimal stopping (Chow and Robbins, 1963) as well as multi-fidelity optimization (Forrester et al., 2007) , and can be seen as a reformulation thereof in the ...
arXiv:2111.00956v1
fatcat:khywklph2jfkbd2at3fvnszf2e
Errata and Addenda to Mathematical Constants
[article]
2021
arXiv
pre-print
We wonder if Shepp's constant can be employed to give a high-precision estimate of the Chow-Robbins constant 2(0.7929535064...) − 1 = 0.5859070128... ...
Lhote [319, 320] developed rigorous techniques for computing H and other constants to high precision. ...
arXiv:2001.00578v2
fatcat:hkauqthvrrdqjis4hctd2hifmu
The biopsychosocial and "complex" systems approach as a unified framework for addiction
2008
Behavioral and Brain Sciences
(5) incorrect search of situation-action-outcome relationships, (6) misclassification of situations, (7) overvaluation in the habit system, (8) a mismatch in the balance of the two decision systems, ( ...
The understanding of decision-making systems has come together in recent years to form a unified theory of decision-making in the mammalian brain as arising from multiple, interacting systems (a planning ...
To those who believe that science gains rigor as it zooms in on the particular, the integrative activity of the brain is no doubt too nebulous an object for any rigorous analysis. ...
doi:10.1017/s0140525x08004822
fatcat:lkekm5lsfvdhpal34inkwwnuv4
« Previous
Showing results 1 — 15 out of 99 results