On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Knowledge sharing and cooperation in outsourcing projects - A game theoretic analysis
Decision Support Systems
Nash equilibria in random games
Random Structures & Algorithms
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
Approximate Nash Equilibria for Multi-player Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
Secret Correlation in Repeated Games with Imperfect Monitoring
Mathematics of Operations Research
Competition between high-speed and conventional rail systems: A game theoretical approach
Expert Systems with Applications: An International Journal
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
A polynomial-time Nash equilibrium algorithm for repeated games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Exploring bidding strategies for market-based scheduling
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Simulating sellers in online exchanges
Decision Support Systems
Computing Nash equilibria through computational intelligence methods
Journal of Computational and Applied Mathematics - Special issue: Selected papers of the international conference on computational methods in sciences and engineering (ICCMSE-2003)
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions
Theory of Computing Systems
Cooperative Peer-to-Peer Streaming: An Evolutionary Game-Theoretic Approach
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 12.05 |
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.