Indexed metadata
Polymatrix Games with Joint Constraints
B. Curtis Eaves
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.