Deception games (Q1099791)

A geneal Deception Game \(\Gamma (n,k,P_ 1,...,P_ n)\) is a two-person zero-sum game of the following form: Each component \(x_ i\) of an ordered n-tuple \((x_ 1,...,x_ n)\) of real numbers is chosen independently from the closed interval [0,1] by means of a probability function \(P_ i\) on [0,1]. Only player 2 sees the n-tuple and, after seeing it, he presents an n-tuple \((y_ 1,y_ 2,...,y_ n)\) to player 1 which satisfies \(y_ i=x_ i\) for at least \(k\leq n\) values of i; this is the ``deception move''. After looking at \((y_ 1,y_ 2,...,y_ n)\) player 1 nominates a positive integer i between 1 and n inclusive and subsequently receives a payoff of \(x_ i.\) It is shown that Deception Games have a value when the strategies of the players are restricted to be Lebesgue measurable functions.