Abstract
A short proof is given to the known result that equilibrium pairs of a two-person general-sum game can be found by solving certain systems of linear inequalities. The technique is then extended to study equilibrium pairs of evolutionary games and auction games. In the former case, evolutionary stable strategies are also determined. Furthermore, it is shown that the computation procedures can be implemented in standard linear programming packages such as LINDO or Maple, and used as education or research tools to handle examples of moderate sizes. Mathematics subject classification (1991): 90D05, 15A39.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
