Login / Signup
Computing better approximate pure Nash equilibria in cut games via semidefinite programming.
Ioannis Caragiannis
Zhile Jiang
Published in:
CoRR (2022)
Keyphrases
</>
pure nash equilibria
semidefinite programming
game theoretic
pure nash equilibrium
linear programming
semidefinite
nash equilibrium
congestion games
primal dual
kernel matrix
game theory
trust model
maximum margin
linear program
worst case
dynamic programming
feature vectors
pairwise