13 citations · 46 across the 31 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Pure Nash Equilibria in Graphical Games of Bounded Width Revisited
Michael Lampis, Yiren Lu
We revisit the complexity of deciding whether a graphical game admits a pure Nash equilibrium (PNE) parameterized by standard measures of the input graph, such as treewidth. The na…
cs.DS2026
Parameterized Capacitated Vertex Cover Revisited
Michael Lampis, Manolis Vasilakis
Capacitated Vertex Cover is a generalization of Vertex Cover where we seek a set of vertices covering all edges, but with the added constraint that for each vertex we are given…