Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/330088 
Authors: 
Year of Publication: 
2024
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 15 [Issue:] 3 [Article No.:] 19 [Year:] 2024 [Pages:] 1-8
Publisher: 
MDPI, Basel
Abstract: 
We consider two companies that are competing for orders. Let X1(n) denote the number of orders processed by the first company at time n, and let τ(k) be the first time that X1(n)
Subjects: 
difference equations
dynamic programming
first-passage time
homing problem
linear equations
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.