75 citations · 671 across the 41 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.GT2008★ 29 cited
Rational Generating Functions and Integer Programming Games
Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne
We explore the computational complexity of computing pure Nash equilibria for a new class of strategic games called integer programming games with difference of piecewise linear co…
math.MG2008★ 64 cited
How to Integrate a Polynomial over a Simplex
Velleda Baldoni, Nicole Berline, Jesus De Loera +2
This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary po…