Which four-part partition games are isomorphic to Silverman's game? (Q1600868)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Which four-part partition games are isomorphic to Silverman's game? |
scientific article |
Statements
Which four-part partition games are isomorphic to Silverman's game? (English)
0 references
16 June 2002
0 references
The author considers the four-part partition zero-sum two-person game \(\Gamma\) described by the following: The sets \(S_1\) and \(S_2\) of the players' pure strategies are intervals in \([0, \infty)\). The rectangle \(S_1\times S_2\) is divided into four parts by three increasing curves \(f_1(x)<f_2(x)<f_3(x)\), where game payoffs are constant on each part. The main result of the paper gives conditions on a pair of increasing bijections \(\Phi\) and \(\Psi\) of \((0,\infty)\), transforming \(S_1\) and \(S_2\) into new intervals \(S_1^*\) and \(S_2^*\), respectively, which guarantee that the new game on the rectangle \(S_1^, \times S_2^,\) becomes a Silverman's game. (By definition, it is the game \(\Gamma\) with curves of the form: \(f_1(x)=Ux\), \(f_2(x)=x\) and \(f_3(x)=x/T\) for some constants \(U,T>0\).).
0 references
partition game
0 references
Silverman's game
0 references
zero-sum game
0 references