A controlled discrete-time queueing system as a model for the orders of two competing companies

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)

MoreLess

Year of publication:	2024
Authors:	Lefebvre, Mario
Published in:	Games. - ISSN 2073-4336. - Vol. 15.2024, 3, p. 1-8
Publisher:	Basel : MDPI
Subject:	difference equations \| dynamic programming \| first-passage time \| homing problem \| linear equations

More details

Type of publication:	Article
Type of publication (narrower categories):	Article
Language:	English
Other identifiers:	10.3390/g15030019 [DOI] 1898439141 [GVK] hdl:10419/330088 [Handle]
Source:	EconStor

Persistent link: https://www.econbiz.de/10015471739