Nash equilibrium for collective strategic reasoning

In multi-player games, the Nash Equilibrium (NE) profile concept deserves a team for selecting strategies during a match, so no player - except in own prejudice - individually deviates from the team selected strategy. By using NE strategy profiles, the way a baseball team increases the possibilities to a match victory is payoff-matrices-based analyzed in this paper. Each matrix entry arrange each player's strategies by regarding the ones from mates and adversaries, and posterior to a NE-profile-selection, the matrix from all players strategies can support the manager's strategic decision-making in the course of a match. A finite state machine, a formal grammar and a generator of random plays are the algorithmic fundament for this collective strategic reasoning automation. The relationships to e-commerce, social and political scopes, as well as to computing issues are reviewed.

[1]  Felix Brandt,et al.  Symmetries and the complexity of pure Nash equilibrium , 2009, J. Comput. Syst. Sci..

[2]  J. Lygeros,et al.  Decision Making I , 2014 .

[3]  George R. Lindsey,et al.  An Investigation of Strategies in Baseball , 1963 .

[4]  Tim Roughgarden,et al.  Computing equilibria in multi-player games , 2005, SODA '05.

[5]  M. J. Wilson,et al.  Decision Making: Approaches and Analysis , 1982 .

[6]  M. Al-Mutairi,et al.  Two-decision-maker cooperative games with fuzzy preferences , 2010, 2010 IEEE International Conference on Industrial Engineering and Engineering Management.

[7]  J. Pang,et al.  Strategic gaming analysis for electric power systems: an MPEC approach , 2000 .

[8]  M. N. Vrahatis,et al.  Computing Nash equilibria through computational intelligence methods , 2005 .

[9]  Albert Y. Zomaya,et al.  Cooperative power-aware scheduling in grid computing environments , 2010, J. Parallel Distributed Comput..

[10]  Liang Gao,et al.  Application of game theory based hybrid algorithm for multi-objective integrated process planning and scheduling , 2012, Expert Syst. Appl..

[11]  Bernhard von Stengel,et al.  Exponentially many steps for finding a Nash equilibrium in a bimatrix game , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[12]  John McMillan.  Games, Strategies, and Managers , 1992 .

[13]  K. J. Ray Liu,et al.  Cooperative peer-to-peer streaming: An evolutionary game-theoretic approach , 2010, IEEE Transactions on Circuits and Systems for Video Technology.

[14]  Peter Stone,et al.  A polynomial-time nash equilibrium algorithm for repeated games , 2003, EC '03.

[15]  Vittorio Bilò,et al.  Designing Fast Converging Cost Sharing Methods for Multicast Transmissions , 2009, Theory of Computing Systems.

[16]  T. Das,et al.  A reinforcement learning algorithm for obtaining the Nash equilibrium of multi-player matrix games , 2009 .

[17]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[18]  Jordi Galí,et al.  A Simple Framework for International Monetary Policy Analysis , 2002 .

[19]  Marios Mavronicolas,et al.  Nash Equilibria in Discrete Routing Games with Convex Latency Functions , 2004, ICALP.

[20]  John E. Roemer,et al.  The Democratic Political Economy Of Progressive Income Taxation , 1999 .

[21]  H. J. van den Herik,et al.  Games, theory and practice , 2004 .

[22]  Adrian Vetta,et al.  Nash equilibria in random games , 2007 .

[23]  Gary Charness,et al.  Endogenous Transfers in the Prisoner's Dilemma Game: An Experimental Test of Cooperation and Coordination , 2006, Games Econ. Behav..

[24]  Michael P. Wellman,et al.  Exploring bidding strategies for market-based scheduling , 2003, EC '03.

[25]  S. Hart,et al.  Handbook of Game Theory with Economic Applications , 1992 .

[26]  Praveen Pathak,et al.  Knowledge sharing and cooperation in outsourcing projects - A game theoretic analysis , 2007, Decis. Support Syst..

[27]  P. Dutta.  Strategies and Games: Theory and Practice , 1999 .

[28]  J. E. Cohen,et al.  Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[30]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[31]  Martin J. Osborne,et al.  An Introduction to Game Theory , 2003 .

[32]  Miklos Santha,et al.  Approximate Nash Equilibria for Multi-player Games , 2008, SAGT.

[33]  Sumantra Ghoshal,et al.  The Strategy Process: Concepts, Contexts, Cases , 1991 .

[34]  David Harrison,et al.  Diamonds around the Globe: The Encyclopedia of International Baseball , 2006 .

[35]  Julius,et al.  TASKS ALLOCATION PROBLEM AS A NON-COOPERATIVE GAME , 2022 .

[36]  J. Bradbury,et al.  The Baseball Economist: The Real Game Exposed , 2007 .

[37]  Jackie Rees Ulmer,et al.  Simulating sellers in online exchanges , 2006, Decis. Support Syst..

[38]  B. Stengel,et al.  COMPUTING EQUILIBRIA FOR TWO-PERSON GAMES , 1996 .

[39]  Yusin Lee,et al.  Competition between high-speed and conventional rail systems: A game theoretical approach , 2010, Expert Syst. Appl..

[40]  Troy Day,et al.  Stability in negotiation games and the emergence of cooperation† , 2004, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[41]  Tristan Tomala,et al.  Secret Correlation in Repeated Games with Imperfect Monitoring , 2007, Math. Oper. Res..

[42]  Aranyak Mehta,et al.  Playing large games using simple strategies , 2003, EC '03.