AN OPTIMAL ASSIGNMENT PROBLEM FOR MULTIPLE OBJECTS PER PERIOD-CASE OF A PARTIALLY OBSERVABLE MARKOV CHAIN - Collections

＜journal article＞
AN OPTIMAL ASSIGNMENT PROBLEM FOR MULTIPLE OBJECTS PER PERIOD-CASE OF A PARTIALLY OBSERVABLE MARKOV CHAIN

Creator	Creator Name Nakai, Toru 中井, 達 Affiliation Affiliation Name Faculty of Economics, Kyushu University 九州大学経済学部
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	1999-03
Source Title	Bulletin of informatics and cybernetics
Vol	31
Issue	1
First Page	23
Last Page	34
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/13478
Related DOI	Bulletin of informatics and cybernetics \|\| 31(1) \|\| p23-34
Related DOI	http://bic.math.kyushu-u.ac.jp/
Related URI	Bulletin of informatics and cybernetics \|\| 31(1) \|\| p23-34
Related URI	http://bic.math.kyushu-u.ac.jp/
Relation	Bulletin of informatics and cybernetics \|\| 31(1) \|\| p23-34
Relation	http://bic.math.kyushu-u.ac.jp/
Abstract	We deal with a sequential stochastic assignment problem on a partially observable Markov chain. This is a generalization of a problem treated in Derman, Lieberman and Ross (1972). Especially, not only... one job will appear at one time period. Under several assumptions, we consider a partially observable Markov chain and several properties concerning a relation between observations and information. On basis of these properties, we investigate the sequential stochastic assignment problem on this partially observable Markov chain.show more

File	FileType	Size	Views	Description
p023	pdf	638 KB	381