Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T21:35:10.021Z Has data issue: false hasContentIssue false

Double Optimal Stopping in the Fishing Problem

Published online by Cambridge University Press:  14 July 2016

Anna Karpowicz*
Affiliation:
Wrocław University of Technology
*
∗ Postal address: Wrocław University of Technology, Institute of Mathematics and Computer Science, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland. Email address: anna.karpowicz@pwr.wroc.pl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we consider the following problem. An angler buys a fishing ticket that allows him/her to fish for a fixed time. There are two locations to fish at the lake. The fish are caught according to a renewal process, which is different for each fishing location. The angler's success is defined as the difference between the utility function, which is dependent on the size of the fish caught, and the time-dependent cost function. These functions are different for each fishing location. The goal of the angler is to find two optimal stopping times that maximize his/her success: when to change fishing location and when to stop fishing. Dynamic programming methods are used to find these two optimal stopping times and to specify the expected success of the angler at these times.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2009