Advanced Search
MyIDEAS: Login to save this paper or follow this series

Anglers’ Fishing Problem


Author Info

  • Karpowicz, Anna
  • Szajowski, Krzysztof


The model considered here will be formulated in relation to the “fishing problem,” even if other applications of it are much more obvious. The angler goes fishing, using various techniques, and has at most two fishing rods. He buys a fishing pass for a fixed time. The fish are caught using different methods according to renewal processes. The fish’s value and the interarrival times are given by the sequences of independent, identically distributed random variables with known distribution functions. This forms the marked renewal–reward process. The angler’s measure of satisfaction is given by the difference between the utility function, depending on the value of the fish caught, and the cost function connected with the time of fishing. In this way, the angler’s relative opinion about the methods of fishing is modeled. The angler’s aim is to derive as much satisfaction as possible, and additionally he must leave the lake by a fixed time. Therefore, his goal is to find two optimal stopping times to maximize his satisfaction. At the first moment, he changes his technique, e.g., by discarding one rod and using the other one exclusively. Next, he decides when he should end his outing. These stopping times must be shorter than the fixed time of fishing. Dynamic programming methods are used to find these two optimal stopping times and to specify the expected satisfaction of the angler at these times.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
File Function: original version
Download Restriction: no

Bibliographic Info

Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 41800.

as in new window
Date of creation: 02 Dec 2010
Date of revision: 24 Jan 2012
Publication status: Published in Annals of the International Society of Dynamic Games Advances in Dynamic Games.12(2012): pp. 327-349
Handle: RePEc:pra:mprapa:41800

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page:
More information through EDIRC

Related research

Keywords: Stopping time Optimal stopping Dynamic programming Semi-Markov process Marked renewal process Renewal–reward process Infinitesimal generator Fishing problem Bilateral approach Stopping game;

Find related papers by JEL classification:


No references listed on IDEAS
You can help add them by filling out this form.



This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:41800. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.