• 検索結果がありません。

SINGLE−LEVEL STRATEGIES FOR FULL-INFORMATlON BEST-CHOICE PROBLEMS. II

N/A
N/A
Protected

Academic year: 2021

シェア "SINGLE−LEVEL STRATEGIES FOR FULL-INFORMATlON BEST-CHOICE PROBLEMS. II"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

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Å帆亡ポ叫

与之しho肪一等叫e㌔†しe負廊

喜3 Z帥−う…b∼∼ト諸oiα甘帥e

.。 勒川

両捉叶止触血中_rY∈〔三烏(示り)

甘心他山よ叫∈せ吋⊥]叩ll困.’㌦

bオ≠抽心・町中や仲川

i;ヤナ佃て㌧れ今′挿さ,や?や軒並)

旭祓ね板よ−や坤

ふ√乙々ア5そ坤押ポ■V 山{{㌻頑旭

げキげ

㌣鳴子Llr之√Lウ十(トレう圭一竹′ l、こI

k†W)と㌔〔ト乙ずつ・ト刃γ㌔l

・..〔lづ粍→誓ん恒」LJ、−㍉

.f _、

Mゎ〔千

賢√lr卜しJ、つJF モ>レ

トげ たl

帥払晶瑠E〃M〃叫叫七帆hh、笹、∫も‘5月ら〔qオ示紳 ノ

仕1トり∫ナントーl′

叶6uく亡

ト℃十ト〔仁l†㌔

叶頼く∫

. i

(トQ)MG.ナゝ

On∼『鴫刷㍉満仲相可一帖一句

h_

−190− © 日本オペレーションズ・リサーチ学会. 無断複写・複製・転載を禁ず.

(2)

エ払竺匪恒虹臼。,ム)_適.

吏ぷ;′′葦㌶箭

h(ち・吊ミ匝−⇒(・瑠丁−≒¢之3叫(ト症

銅山oれ一柳仙南兢隼腔

払→」一輝/ふ戒/〟ヱ∫′ 心材捏

IL八一L__ ▲J ∴ _.ノ

瑚転地L刷裾仕叫町椀r竹篭れ  ̄、 り■ l′▼  ̄  ̄l卜∂}■ ‰」ら蟻扉

h鵠温も仙てG冊 帖い十再湖心・

M.〔叫=

hつ(卜㌦

けくレ

叶りW

トー乙町+マ

M乙〔りこMt〔彗モ),

− 、

■▼  ̄ニ ̄一一

乞(ト吋ヤ

〕,建垣

d ルIIl

彊、.虹色rL咄

ミ .

㌶霊昔満−)ノ止与謝

「L叫んィ

− uご;α曾町

侃†ケLO tr′叫㌻コっ ¶ニJb Zo わ

叫呵,一一山二Z㌔鍋物 ○

紳叫

q珊P

巧門‘7 αシjユダ 射卵r _ll ▲ _−1 ¶…蜘前項地声・甘 l

−♭扉山♭成定、・≠柚_

憲二愁雲銘誹

、こ;ミ∼ご

. ヽ′■ J←0ぐ尽く♭ ′ ′

のハ、eんu

〔屯−,

山一 サ

一.

一ウ

︵叫 ‰

山山 q。与rlJ7ク

寄碧七帰

。)≒叫○け.

l与 良h“r 山r∂オトー 且(q−I汀㌧ 祐一g久一a→乞 (叫て◎各)

F鵡仲ハ∼bや㌍rrhMれヤ抑山笠帥…ヽ抽斗

ー191− © 日本オペレーションズ・リサーチ学会. 無断複写・複製・転載を禁ず.

参照

関連したドキュメント

For instance, Racke & Zheng [21] show the existence and uniqueness of a global solution to the Cahn-Hilliard equation with dynamic boundary conditions, and later Pruss, Racke

Under the basic assumption of convergence of the corresponding imbedded point processes in the plane to a Poisson process we establish that the optimal choice problem can

Since one of the most promising approach for an exact solution of a hard combinatorial optimization problem is the cutting plane method, (see [9] or [13] for the symmetric TSP, [4]

For arbitrary 1 < p < ∞ , but again in the starlike case, we obtain a global convergence proof for a particular analytical trial free boundary method for the

Since the boundary integral equation is Fredholm, the solvability theorem follows from the uniqueness theorem, which is ensured for the Neumann problem in the case of the

The technical results above are in fact related,: the LQ lemma plays a key role in the proof of “free independence embeddings of L ∞ ([0, 1])”, while the free independence

Next, we prove bounds for the dimensions of p-adic MLV-spaces in Section 3, assuming results in Section 4, and make a conjecture about a special element in the motivic Galois group

“Breuil-M´ezard conjecture and modularity lifting for potentially semistable deformations after