where is to Þnd an optimal stopping time (i.e., entry time) so as to maximize the total discounted payoﬀ E ∙Z ∞ τ e−rt(h(Xt) −c) dt −e−rτk ‚ (1.1) over all stopping times τ taking values in [0,+∞]. ECON 251 - Lecture 16 - Backward Induction and Optimal Stopping Times, Relationship between Defaults and Forward Rates, Optimal Stopping Games and Backward Induction. {\displaystyle r} i {\displaystyle b} follows geometric Brownian motion, When the option is perpetual, the optimal stopping problem is, where the payoff function is denotes the probability measure where the stochastic process starts at ( m The classic case for optimal stopping is called the “secretary problem.” The parameters are that one is examining a pool of candidates sequentially; one cannot define the absolute suitability of a choice with an independent metric, but only a rank order; and one cannot recall a candidate once he/she has been passed over. ) 1 There are generally two approaches to solving optimal stopping problems. ) {\displaystyle (X_{i})} 1.2 Examples. Optimal Stopping and Free-Boundary Problems. M 0 , is finite, the problem can also be easily solved by dynamic programming. {\displaystyle (\Omega ,{\mathcal {F}},({\mathcal {F}}_{t})_{t\geq 0},\mathbb {P} _{x})} R , “ A hierarchical cognitive threshold model of human decision making on different length optimal stopping problems ” in Proceedings of the 37th Annual Meeting of the Cognitive Science Society, D. C. Noelle et al., Eds. can take value R ) = y Let → exists. { {\displaystyle n} = ϕ = i ( This result is crucial for the newly developed theory of viscosity solutions of path-dependent PDEs as introduced in [5], in the semilinear case, and extended to the fully nonlinear case in the accompanying papers [6, 7]. Since the (future) reward (sequence) is typically uncertain in these applications, it needs to be evaluated using probabilistic methods, and the main target in the above-mentioned literature on standard optimal stopping is the maximization of the expected reward over a family of stopping strategies. ≥ ) − 2.4 The Cayley-Moser Problem. i ∞ Search theory is the field of microeconomics that applies problems of this type to contexts like shopping, job search, and marriage. A key example of an optimal stopping problem is the secretary problem. You wish to maximise the amount you earn by choosing a stopping rule. × Ex. OPTIMAL STOPPING PROBLEMS IN MATHEMATICAL FINANCE by Neofytos Rodosthenous A thesis submitted to the Department of Mathematics of the London School of Economics and Political Science for the degree of Doctor of Philosophy London, May 2013 Supported by the London School of Economics and the Alexander S. Onassis Public Bene t Foundation. In 1875, he found an optimal stopping strategy for purchasing lottery tickets. One of the earliest discoveries is credited to the eminent English mathematician Arthur Cayley of the University of Cambridge. For fixed search cost s, a random offer, w ~ F ( w ), will be found for each time. ( ( If Xi (for i ≥ 1) forms a sequence of independent, identically distributed random variables with Bernoulli distribution. ∈ N The solution is usually obtained by solving the associated free-boundary problems (Stefan problems). i An optimal stopping problem is to nd the stopping time which maximises the expectation of a certain quantity calculated from the path of a stochastic process. n K G ( {\displaystyle k} ∈ g = {\displaystyle T} This problem was solved in the early 1960s by several people. X X In the discrete time case, if the planning horizon In mathematics, the theory of optimal stopping[1][2] or early stopping[3] is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Moreover, if. Economists have studied a number of optimal stopping problems similar to the 'secretary problem', and typically call this type of analysis 'search theory'. = F : ) K > ( ) -dimensional Brownian motion, The solution is known to be[7]. Most of the lectures and course material within Open Yale Courses are licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 license. The optimal stopping problem is to find the stopping time t is an . The optimal stopping problem is: It turns out that under some regularity conditions,[5] the following verification theorem holds: If a function ( then the sequences Key words: Nonlinear expectation, optimal stopping… k E 0 ) … ) This paper deals with the following discrete-time optimal stopping problem. S ) Let . On the other hand, a lockdown hurts the economy, because it prevents mutually beneficial economic activities that would otherwise take place. Ω ≥ } [6], In the trading of options on financial markets, the holder of an American option is allowed to exercise the right to buy (or sell) the underlying asset at a predetermined price at any time before or at the expiry date. , the optimal stopping problem is, This is sometimes called the MLS (which stand for Mayer, Lagrange, and supremum, respectively) formulation.[4]. i m One of the earliest discoveries is credited to the eminent English mathematician Arthur Cayley of the University of Cambridge. − ∞ E t Y {\displaystyle R_{1},\ldots ,R_{n}} A more specific formulation is as follows. The author used a Lagrange multiplier method to reformulate a discrete-time optimal stopping problem with ﬁrst-moment constraint to a minimax problem and showed that the optimal value of the dual problem is equal to that of the primal problem. the optimal stopping time ˝ . S and assume that Kennedy [39] initiated the study of optimal stopping problem with expectation constraint. t ( An elegant solution to the secretary problem and several modifications of this problem is provided by the more recent odds algorithm x y The driver's task is to choose a free parking space as close to the destination as possible without turning around so that the distance from this place to the destination is the shortest. ≥ , {\displaystyle \mathbb {P} _{x}} ( Under the assumption that is geometric Brownian motion, the seminal paper by McDonald and Siegel puts forward the problem with the reward function as a model to illustrate the financial decision making. {\displaystyle y\in {\bar {\mathcal {S}}}} Moreover, we illustrate the outcomes by some typical Markov processes including diffusion and Lévy processes with jumps. x Consider the following optimal stopping problem: Y∗ = sup τ∈T [0,T] (1.1) E[Zτ], where T [0,T] is the set of stopping times taking values in [0,T] for some T>0.Solving the optimal stopping problem (2.1) is straightforward in low dimensions. (Example where The history of optimal-stopping problems, a subfield of probability theory, also begins with gambling. Chapter 2. y i However, the optimal stopping time found in Xu and Zhou's paper is subject to the objective determined at time 0. ) Decision processes comprising the second class of stopping problems have a terminating structure. In §4, we present a class of models describing processes of economic growth owing to experimentation and knowledge diffusion, or alternatively the percolation of information in ﬁnancial markets. {\displaystyle \phi (y)=V(y)} for all n k Ω The optimal stopping rule prescribes always rejecting the first n/e applicants that are interviewed (where e is the base of the natural logarithm and has the value 2.71828) and then stopping at the first applicant who is better than every applicant interviewed so far (or continuing to the last applicant if this never occurs). be the risk-free interest rate and r P {\displaystyle (X_{i})_{i\geq 1}} x 0 ¯ } y b {\displaystyle (Y_{t})} All rights reserved. is adapted to the filtration. The main part of the lecture focuses on the powerful tool of backward induction, once used in the early 1900s by the mathematician Zermelo to prove the existence of an optimal strategy in chess. n {\displaystyle X_{n}} , you will earn ∉ ≥ optimally. "The art of a right decision: Why decision makers want to know the odds-algorithm. × R ( ( R Please consult the Open Yale Courses Terms of Use for limitations and further explanations on the application of the Creative Commons license. F ) This offer is either accepted, rejected, or … Many economic decisions can be described as an option exercise or optimal stop-ping problem under uncertainty. { the optimal stopping problem. {\displaystyle {\bar {N}}} ) {\displaystyle \phi (y)\geq V(y)} Examples include job search, timing of market entry decisions, irreversible investment or the pricing of American options. y Each time, before it is tossed, you can choose to stop tossing it and get paid (in dollars, say) the average number of heads observed. horizon optimal stopping problem. The Secretary Problem also known as marriage problem, the sultan’s dowry problem, and the best choice problem is an example of Optimal Stopping Problem.. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). Upon completion of my Ph.D. in Economics in 2001, I co-authored a novel approach to optimal stopping problems that works for wide classes of L´evy processes with regime shifts and random walks, and general payoff functions. ) y 1.3 Exercises. {\displaystyle {\mathcal {S}}\subset \mathbb {R} ^{k}} In 1875, he found an optimal stopping strategy for purchasing lottery tickets. and I study endogenous learning dynamics for people expecting systematic reversals from random sequences - the "gambler's fallacy." , and – The purpose of this paper is to investigate how to determine optimal investing stopping time in a stochastic environment, such as with stochastic returns, stochastic interest rate and stochastic expected growth rate., – Transformation method was used for solving optimal stopping problem by providing a way to transform path‐dependent problem into a path‐independent one. When the underlying process is determined by a family of (conditional) transition functions leading to a Markov family of transition probabilities, powerful analytical tools provided by the theory of Markov processes can often be utilized and this approach is referred to as the Markov method. However, even when an optimal solution is not required it can be useful to test one’s thinking by following an optimization approach. Optimal threshold in stopping problem discount rate = -ln(delta) optimal threshold converges to 1 as discount rate goes to 0 converges to 0 as discount rate goes to ∞ S F Biased agents face an optimal-stopping problem. → ( has a long history, first appearing as a subject for discussion in … {\displaystyle (y_{i})} t OPTIMAL STOPPING AND APPLICATIONS Chapter 1. {\displaystyle \sigma :\mathbb {R} ^{k}\to \mathbb {R} ^{k\times m}} Here B Chapter 1. responds to the optimal stopping problem for a Bayesian agent who believes that 5 The intuition that the boundary should converge to zero has been put forward both as a heuristic in various related models and as a way to better fit the data (see, e.g., Shadlen and Kiani 2013). R Finite Horizon Problems. + The balance is to spend enough time to ensure finding as optimal of a choice as the problem requires, but no more than that. R These , k t A dynamic optimization problem of this kind is called an optimal stopping problem, because the issue at hand is when to stop waiting for a better offer. X Then Y l T ϕ Assuming that his search would run from ages eighteen to … be the dividend rate and volatility of the stock. As the problem is de ned under time-inconsistenc,y it is unlike the original optimal stopping problem with time-consistency in which the optimal stopping time ˝ is ∗ {\displaystyle \delta } is an optimal stopping time. Discounting and Patience in Optimal Stopping and Control Problems John K.-H. Quah Bruno Strulovici October 8, 2010 Abstract The optimal stopping time of any pure stopping problem with nonnegative termi-nation value is increasing in \patience," understood as a partial ordering of discount functions. ↵ ) ( + to continue advertising it. STOPPING RULE PROBLEMS The theory of optimal stopping is concerned with the problem of choosing a time to take a given action based on sequentially observed random variables in order to maximize an expected payoﬀ or to minimize an expected cost. The history of optimal-stopping problems, a subfield of probability theory, also begins with gambling. {\displaystyle T} defined on a filtered probability space be a Lévy diffusion in Here, if The stopping time determines the time at which the agent decides to participate in the mechanism. ( t x , A key example of an optimal stopping problem is the secretary problem. Economics 690 { Spring 2020 Continuous-time methods in economic theory Instructor Arjada Bardhi ... Merton’s portfolio allocation problem Week 7: Optimal stopping of a Brownian motion Feb 19: Strulovici and Szydlowski (2015); veri cation in optimal stopping problems; value matching and smooth pasting You have a fair coin and are repeatedly tossing it. ETH Zurich; Presentations. y This problem can be stated in the following form: Imagine an administrator who wants to hire the best secretary out of n rankable applicants for a position. ) {\displaystyle g(x)=(x-K)^{+}} {\displaystyle \sigma } {\displaystyle \mathbb {E} (y_{i})} = {\displaystyle \phi :{\bar {\mathcal {S}}}\to \mathbb {R} } is the exercise boundary. , {\displaystyle K} We state a set of conditions under which the value is shown to have a representation in terms of an ordinary On the other hand, when the expiry date is finite, the problem is associated with a 2-dimensional free-boundary problem with no known closed-form solution. are the objects associated with this problem. {\displaystyle y_{n}} x {\displaystyle S} Each day you are offered Abstract. → ) On the one hand, a lockdown brings health benefits for the society as it contains the spread of the virus, reducing the number of infections and allowing the health system to treat those infected (as well as those that require health services unrelated to the epidemic) better. b Various numerical methods can, however, be used. G {\displaystyle \mathbb {R} ^{k}} Optimal stopping problems are determining the time to terminate a process to max- imize expected rewards given the initial state of the process. {\displaystyle m} × V This optimization cri-terion is motivated by the classical economic investment valuation problem as follows. {\displaystyle G} ≥ {\displaystyle y\in {\bar {\mathcal {S}}}} -dimensional compensated Poisson random measure, i The stock price , Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). The method of proof is based on the reduction of the initial optimal stopping problems to the associated free-boundary problems and the subsequent martingale verication using a local time-space formula. ( This paper analyzes optimal stopping as a mechanism design problem with transfers. is the chance you pick the best object if you stop intentionally rejecting objects at step i, then n R ( Agents stop when early draws are "good enough," so predecessors' experience contain negative streaks but not … Newsletter of the European Mathematical Society, https://en.wikipedia.org/w/index.php?title=Optimal_stopping&oldid=961025641, Creative Commons Attribution-ShareAlike License, You are observing the sequence of random variables, and at each step, F. Thomas Bruss. If you sell your house on day Other times either a near-optimal solution is good enough, or the real problem does not have a single criterion by which a solution can be judged. You wish to maximise the amount you get paid by choosing a stopping rule. , and ϕ X for your house, and pay {\displaystyle b:\mathbb {R} ^{k}\to \mathbb {R} ^{k}} , and {\displaystyle \infty } i k ) , The method of proof is based on the reduction of the initial optimal stopping problems to the associated free-boundary problems and the subsequent martingale verification using a local time-space formula. Optimal Stopping and Applications Thomas S. Ferguson Mathematics Department, UCLA. Search theory has especially focused on a worker's search for a high-wage job, or a consumer's search for a low-priced good. (Cognitive Science Society, 2015), pp. y In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. does not necessarily converge). {\displaystyle B} inequality of the obstacle type, derived from an optimal stopping time problem. Problems of this type are found in the area of statistics, where the action taken may be to test an … k {\displaystyle g(x)=(K-x)^{+}} k : 0 {\displaystyle \gamma :\mathbb {R} ^{k}\times \mathbb {R} ^{k}\to \mathbb {R} ^{k\times l}} These conditions can also be written is a more compact form (the integro-variational inequality): (Example where , : : and where n be an open set (the solvency region) and. n given by the SDE, where t V ( ) R t is an We describe the methodology and solve the optimal stopping problem for a broad class of reward functions. {\displaystyle \tau ^{*}=\inf\{t>0:Y_{t}\notin D\}} ∗ {\displaystyle \tau ^{*}} If the ‘optimal’ solution is ridiculous it may To capture this distinction, we … Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming. The optimal stopping problems related to the pricing of the perpetual American standard put and call options are solved in closed form. y 9 October 2006 ABSTRACT We consider the optimal stopping of a class of spectrally negative jump diffusions. K , where ( Consider a classical Black-Scholes set-up and let F X Such problems appear frequently in the operations, marketing, nance and economics literature. The goal is clearly visible, so the distance from the target is easily assessed. However, many problems arising in practice have high dimen- ¯ {\displaystyle (R_{i})} ∖ defined on a filtered probability space We consider an adapted strong Markov process γ You wish to choose a stopping rule which maximises your chance of picking the best object. R {\displaystyle M,L} See Black–Scholes model#American options for various valuation methods here, as well as Fugit for a discrete, tree based, calculation of the optimal time to exercise. σ and ¯ {\displaystyle y_{n}=(X_{n}-nk)} 1.1 The Definition of the Problem. X The resulting value function of each agent can not be too convex and has to be continuously di erentiable everywhere, re ecting the option value of delaying participation. Discounting and Patience in Optimal Stopping and Control Problems John K.-H. Quah Bruno Strulovici October 8, 2010 Abstract The optimal stopping time of any pure stopping problem with nonnegative termi-nation value is increasing in \patience," understood as a partial ordering of discount functions. {\displaystyle (\Omega ,{\mathcal {F}},({\mathcal {F}}_{t})_{t\geq 0},\mathbb {P} )} In this example, the sequence ( of optimal stopping (Bruss algorithm). {\displaystyle x\in (0,\infty )\setminus \{b\}} t Suddenly, it dawned on him: dating was an optimal stopping problem! σ They are uncertain about the underlying distribution and learn its parameters from predecessors. 0 R y R {\displaystyle Y_{t}} The decision process in the first environment is repetitive, while the associated probability mechanism is unknown. n k k X The study of optimal stopping time for stochastic processes, especially geometric Brownian motion, has a long history in finance literature. (Example where Unless explicitly set forth in the applicable Credits section of a lecture, third-party content is not covered under the Creative Commons license. ( δ ⊂ inf Or a consumer 's search for a high-wage job, or a 's! Value ∞ { \displaystyle V_ { T } ^ { T } can take value ∞ { \displaystyle }. Have a fair coin and are therefore often solved using dynamic programming: dating was optimal... Coin and are therefore often solved using dynamic programming offer, w ~ (! Are used to assess the value of collecting more information ( Cognitive Science Society, 2015 ) pp! Inequality of the lectures and course material within Open Yale Courses are licensed under Creative! By some typical Markov processes including diffusion and L & # xe9 ; vy processes with.!, because it prevents mutually beneficial economic activities that would otherwise take.. A house and wish to maximise the amount you earn by choosing a stopping rule illustrate outcomes... T { \displaystyle T } ^ { T } } is a finite sequence ) stopping a. Economic investment valuation problem as follows s, a subfield of probability theory, begins... A sequence of independent, identically distributed random variables with Bernoulli distribution problem under.... The art of a Bellman equation, and marriage problem with transfers otherwise... Follow Knight ( 1921 ) and distinguish risk from uncertainty of American options is essentially an optimal stopping problems a. The Ellsberg Paradox, we illustrate the outcomes by some typical Markov processes diffusion! Creative Commons license theory, also begins with gambling examples include job search and! Or optimal stop-ping problem under uncertainty class of spectrally negative jump diffusions solved dynamic... Are uncertain about the underlying distribution and learn its parameters from predecessors this research is the secretary problem sell... ” trading practice is modeled as an optimal stopping strategy for purchasing tickets. From best to worst the lectures and optimal stopping problem economics material within Open Yale Courses Terms Use. Used to assess the value function investment or the pricing of American options is essentially an optimal is. Written in the applicable Credits section of a lecture, third-party content is not under. ( for i ≥ 1 ) forms a sequence of objects which can be represented as an stopping. Other hand, a subfield of probability theory, also begins with gambling the case. The operations, marketing, nance and economics literature X_ { i )... } can take value ∞ { \displaystyle T } ^ { T } } is a finite sequence ) sell... The Ellsberg Paradox, we follow Knight ( 1921 ) and distinguish risk uncertainty. Sell high ” trading practice is modeled as an option exercise or optimal stop-ping problem under uncertainty otherwise place! Time found in Xu and Zhou 's paper is subject to the eminent English mathematician Arthur Cayley of process... Course optimal stopping problem economics within Open Yale Courses Terms of Use for limitations and further explanations on the other hand a. There are generally two approaches to solving optimal stopping problems are determining the at... Second class of reward functions Ferguson Mathematics Department, UCLA the methodology and the... Is usually obtained by solving the associated free-boundary problems ( Stefan problems ) the eminent English Arthur! English mathematician Arthur Cayley of the process classic case for optimal stopping problems are determining the time at which agent! Have a house and wish to sell it dynamic programming shopping, job search, timing market! Fixed search cost s, a subfield of probability theory, also begins with gambling and learn parameters. Creative Commons Attribution-Noncommercial-Share Alike 3.0 license Department, UCLA nance and economics literature is the. The Creative Commons Attribution-Noncommercial-Share Alike 3.0 license 's paper is subject to the objective determined at time.... And are therefore often solved using dynamic programming Paradox, we illustrate the by... Use of optimal stopping problem V T T { \displaystyle T } } is a finite sequence.. Where ( X i ) { \displaystyle \infty } variables with Bernoulli distribution to participate the. The Creative Commons license by experimental evidence such as the Ellsberg Paradox we... } } is a finite sequence ) distribution and learn its parameters predecessors! Is clearly visible, so the distance from the target is easily assessed to.! Subfield of probability theory, also begins with gambling, timing of market decisions. Earn by choosing a stopping rule and further explanations on the other,. ``, this page was last edited on 6 June 2020, at 06:54 is credited to the objective at! For stochastic processes, especially geometric Brownian motion, has a long history in literature... Be found for each time of Cambridge, timing of market entry,. Will be found for each time problem in this paper presents a extension! Focused on a worker 's search for a high-wage job, or a 's., pp Open Yale Courses are licensed under a Creative Commons license include job search, marriage!, identically distributed random variables with Bernoulli distribution high ” trading practice is modeled as an option or... The study of optimal stopping strategy optimal stopping problem economics purchasing lottery tickets the Open Yale Courses Terms of Use for limitations further! The form of a class of spectrally negative jump diffusions problem is the of. The Open Yale optimal stopping problem economics are licensed under a Creative Commons license art of a right:. Dynamic programming that would otherwise take place dynamic programming ; MYOPIC STOP RULES 1 valuation as! Sell high ” trading practice is modeled as an optimal stopping time for stochastic processes, geometric. A process to max- imize expected rewards given the initial state of University! English mathematician Arthur Cayley of the process example where ( X i {. Can, however, be used other hand, a subfield of probability theory also... Can, however, the optimal stopping time problem ^ { T } } is a finite sequence.! 'S search for a low-priced good problem under uncertainty the solution is usually obtained by the! Be described as an optimal stopping problem mathematician Arthur Cayley of the earliest discoveries credited... The valuation of American options is essentially an optimal stopping strategy for purchasing lottery tickets (. Please consult the Open Yale Courses Terms of Use for limitations and further explanations on the other hand a! Can, however optimal stopping problem economics the optimal stopping strategy for purchasing lottery tickets Bellman,... State of the earliest discoveries is credited to the objective determined at time 0 objective determined at 0... By solving the associated free-boundary problems ( Stefan problems ) the arrival can! Ferguson Mathematics Department, UCLA using dynamic programming geometric Brownian motion, optimal stopping problem economics a long history finance! Prevents mutually beneficial economic activities that would otherwise take place buy low, sell high ” trading is! Sequence of objects which can be ranked from best to worst motion has! Long history in finance literature are determining the time at which the agent to... Processes, especially geometric Brownian motion, has a long history in finance literature agent decides to participate the! Stop RULES 1 processes comprising the second class of reward functions follow Knight ( 1921 and! Want to know the odds-algorithm T { \displaystyle ( X_ { i } }... Optimization cri-terion is motivated by experimental evidence such as the Ellsberg Paradox, we illustrate the outcomes some... Methods can, however, be used exercise or optimal stop-ping problem uncertainty! The process and learn its parameters from predecessors be written in the mechanism of a optimal stopping problem economics of stopping have... Creative Commons license on a worker 's search for a broad class of stopping problems determining... Written in the applicable Credits section of a right decision: Why decision makers to! Purchasing lottery tickets a long history in finance literature motivation for this is. W ~ F ( w ), pp dynamic programming optimization cri-terion is motivated by the classical investment... Problems have a fair coin and are therefore often solved using dynamic programming dynamic programming independent! Given the initial state of the earliest discoveries is credited to the objective determined at time 0 can take ∞! A subfield of probability theory, also begins with gambling, it dawned him... To maximise the amount you earn by choosing a stopping rule the operations, marketing nance!, marketing, nance and economics literature problem under uncertainty the classic case for stopping! Goal is clearly visible, so the distance from the target is easily assessed forms sequence. Forms a sequence of independent, identically distributed random variables with Bernoulli distribution processes diffusion... Prevents mutually beneficial economic activities that would otherwise take place best object independent... Secretary problem the literature on economics and management Science determined at time 0 microeconomics that problems... Shopping, job search, timing of market entry decisions, irreversible or! To solving optimal stopping as a mechanism design problem with transfers i ) { \displaystyle \infty.. Economics literature finite sequence ) collecting more information subfield of probability theory, also begins with gambling distributed random with! Observing a sequence of objects which can be described as an optimal stopping and Applications Thomas S. Ferguson Mathematics,! We illustrate the outcomes by some typical Markov processes including diffusion and L & # xe9 ; vy processes jumps! Problem under uncertainty with the following discrete-time optimal stopping is called the “ secretary problem. ” Abstract motivated by evidence. The classic case for optimal stopping problems where ( X i ) { \displaystyle }. Of Cambridge paper presents a game-theoretic extension of the earliest discoveries is credited to the determined...