Polymatrix Games with Joint Constraints.
Abstract
Given an n-person game with quadratic-type objectives and joint linear constraints, it is demonstrated that Lemke's algorithm can be used to compute a Nash equilibrium. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1972
- Accession Number
- AD0740217
Entities
People
- B. Curtis Eaves
Organizations
- Stanford University