IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Optimal Pilfering Policies for Dynamic Continuous Thieves

Listed author(s):
  • Suresh P. Sethi

    (University of Toronto)

This paper considers the problems of a dynamic continuous thief, such as a habitual shoplifter or a gas siphoner, who must choose the pilfering rate (which increases the probability of his arrest over time) to maximize the present value of his total expected gain over a given finite or infinte horizon. The gain function incorporates the amount of pilfering, the one-shot penalty at the time of arrest and the continuous punishment subsequent to arrest. A thief is classified as a profit-maximizer, a kleptomaniac, or a risk-averter depending on whether he considers his gain function to be linear, convex, or concave in the pilfering rate, respectively. Optimal pilfering rates are obtained for each of these different types of thieves by using the methods of optimal control. It is shown that the optimal pilfering policy of a profit-maximizing thief is bang-bang, i.e., either to pilfer at the maximum possible rate or not to pilfer at all. In the particular case of a finitely-lived profit-maximizing thief, the optimal policy is not to pilfer while the thief is young and then to pilfer at the maximum rate toward the end of his life so that the continuous punishment subsequent to his arrest will not last too long. In the infinite horizon cases, both the profit-maximizing thieves and kleptomaniacs will either never pilfer or pilfer at the maximum rate depending on whether the parameters of the problem they are facing are unfavorable or favorable. The risk-averse thief, on the other hand, would settle at an intermediate pilfering rate throughout the infinite horizon. Finally, it is expected that knowledge of these optimal policies will have implications for the allocation of money between police, courts and penal institutions.

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:
Download Restriction: no

Article provided by INFORMS in its journal Management Science.

Volume (Year): 25 (1979)
Issue (Month): 6 (June)
Pages: 535-542

in new window

Handle: RePEc:inm:ormnsc:v:25:y:1979:i:6:p:535-542
Contact details of provider: Postal:
7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

Phone: +1-443-757-3500
Fax: 443-757-3515
Web page:

More information through EDIRC

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.

When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:25:y:1979:i:6:p:535-542. 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: (Mirko Janc)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.