×

Optimal strategies for some team games. (English) Zbl 0745.90094

Summary: Consider a game between teams \(A\) and \(B\), consisting of a sequence of matches, where each match takes place between one player \(i\) from \(A\) and one player \(j\) from \(B\). Given the probability that player \(i\) wins over player \(j\), we investigate optimal strategies on how to choose a player for the next match, for the following two types of team games. The first type assumes that after each match, the loser is eliminated from the list of remaining players, while the winner remains in the list. The team from which all players are eliminated loses the game. Assuming the Bradley- Terry model as the probability model, we first show that the winning probability does not depend on the strategy chosen. It is also shown that the Bradley-Terry model is essentially the only model for which this strategy independence holds. The second type of game assumes that both players are eliminated after each match. In this case, it is shown that choosing a player with equal probability is an optimal strategy in the sense of maximizing the expected number of wins of matches, provided that information about the order of players in the other teams is not available. The case in which the team knows the ordering of the other team is also studied.

MSC:

91A20 Multistage and repeated games
91A60 Probabilistic games; gambling
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] . (1966)
[2] Bradley, R. A.: Incomplete block rank analysis: on the appropriateness of the model for a method of paired comparisons. Biometrics 10, 375-390 (1954) · Zbl 0058.35803
[3] Bradley, R. A.: Rank analysis of incomplete block designs II. Additional tables for the method of paired comparisons. Biometrika 41, 502-537 (1954) · Zbl 0056.38103
[4] Bradley, R. A.: Rank analysis of incomplete block designs III. Some large sample results on estimation and power for a method of paired comparisons. Biometrika 42, 450-470 (1955) · Zbl 0067.12003
[5] Bradley, R. A.; Terry, M. E.: Rank analysis of incomplete block designs I. The method of paired comparisons. Biometrika 39, 324-354 (1952) · Zbl 0047.12903
[6] Dror, M.: Simple proof for goofspiel: the game of pure strategy. Adv. in appl. Probab. 8, 711-712 (1989) · Zbl 0673.90095
[7] Fararo, T. J.: Mathematical sociology: an introduction to fundamentals. (1973)
[8] Gale, D.: Information in games with finite resources. Contribution to the theory of games, 141-145 (1957) · Zbl 0078.32901
[9] Heyman, D. P.; Sobel, M. J.: Stochastic models in operations research vol. II: stochastic optimization. (1984) · Zbl 0531.90062
[10] Katoh, N.; Adachi, A.: Mathematical considerations on the relationship between the ordering of players and winning probability in certain types of team sports. J. oper. Res. soc. Japan 32, 390-406 (1989)
[11] Luce, R. D.: Individual choice behaviour. (1959) · Zbl 0093.31708
[12] Papadimitriou, C. H.; Steiglitz, K.: Combinatorial optimization: algorithms and complexity. (1982) · Zbl 0503.90060
[13] Ross, S. M.: Goofspiel – the game of pure strategy. J. appl. Probab. 8, 621-625 (1971) · Zbl 0219.90056
[14] Ross, S. M.: Introduction to stochastic dynamic programming. (1983) · Zbl 0567.90065
[15] Takeuchi, K.; Fujino, K.: Measuring strengths. Comm. oper. Res. soc. Japan 24, 85-92 (1979)
[16] Takeuchi, K.; Fujino, K.: Mathematical science of sports. (1988)
[17] Van Der Wal, J.: Stochastic dynamic programming: successive approximations and nearly optimal strategies for Markov decision processes and Markov games. Mathematical centre tracts 139 (1981) · Zbl 0462.90055
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.