2−B−4
1997年度日本オペレーションズ・リサーチ学会 秋季研究発表会SINGLE−LEVEL STRATEGIES FORFULIJ−INFORMATlON
BEST−CHOICE PROBI.EMS.ⅠI
O/ヱの陀牛島て風あ押え与 七夜日 食 MINORUSAK人G。。1ir
lto‘ッヮゥL相木等 k.ソヤ2ウスキKRZYSZTOFSZ^JOWSKl
A8STR^CT.Continulng the workin the p【eVious.paper,P8rtl,We discus8SOme rulトinfor一坤ionbest−Choiceproblemsandtheirextensiontotwo−playercornpctiLive 8ituation.Threeproblem8are・fbrmulatedandsoIYed・(l)Best−Choiceproblem、Vhere theobjecLiveis to8elect the k bests amongsequenLia11y amYlng n r・V・S,砧dwith commonunirbrmdi8tributionon tO,1】,(2)乙erO−SumbesL−CllOi亡e gameWhereeach player’8ObjectiYei5tO Select a r.u.)arger than o叱Chosen by the opponent8nd player8,priorityisgiYeninadYanCe,and(3)non−ZerO−9umgameVaria・ntOr(2).where eachplayerisglVenhisown6equenCeOrr・V・Sindividually・Thestrategiesalloweda・re restrictedtothesingle−1eYelstrategie9,andin(1)and(2)th?tOtalnumber,N・Or sequentiallya.rriYingr.tl.Si8al60ar.tl.Obeyinggeometricdistributionwithp8rameLerO. 盲l工り叶0Å帆亡ポ叫