Ans 1 ln game Lheory fo|k theorems are a class of Lheorems whlch

lmply LhaL ln repeaLed games any ouLcome ls a feaslble soluLlon

concepL lf under LhaL ouLcome Lhe players mlnlmax condlLlons are
saLlsfled 1he mlnlmax condlLlon sLaLes LhaL a player wlll mlnlmlze Lhe
maxlmum posslble loss whlch he could face ln Lhe game An ouLcome ls
sald Lo be feaslble lf lL saLlsfles Lhls condlLlon for each player of Lhe
game A repeaLed game ls one ln whlch Lhere ls noL necessarlly a flnal
move buL raLher Lhere ls a sequence of rounds durlng whlch Lhe
player may gaLher lnformaLlon and choose moves
kCCI A grlm Lrlgger sLraLegy ls a sLraLegy whlch punlshes an
opponenL for any devlaLlon from some cerLaln behavlor So all of Lhe
players of Lhe game flrsL musL have a cerLaln feaslble ouLcome ln mlnd
1hen Lhe players need only adhere Lo an almosL grlm Lrlgger sLraLegy
under whlch any devlaLlon from Lhe sLraLegy whlch wlll brlng abouL Lhe
lnLended ouLcome ls punlshed Lo a degree such LhaL any galns made by
Lhe devlaLor on accounL of Lhe devlaLlon are exacLly cancelled ouL
1hus Lhere ls no advanLage Lo any player for devlaLlng from Lhe course
whlch wlll brlng ouL Lhe lnLended and arblLrary ouLcome and Lhe
game wlll proceed ln exacLly Lhe manner Lo brlng abouL LhaL ouLcome
Ans 2 |)


ll)Causslan


Ans 3
Plrschberg algorlLhm
for flndlng connecLed componenL ln a graph
Ans 4

Ans 3

Ans 6
l)parallel asplraLlon search

lll)