
-
Computing Nash equilibria for integer programming games
The recently defined class of integer programming games (IPG) models sit...
read it
-
Curriculum learning for multilevel budgeted combinatorial problems
Learning heuristics for combinatorial optimization problems through grap...
read it
-
Complexity of the Multilevel Critical Node Problem
In this work, we analyze a sequential game played in a graph called the ...
read it
-
Provable Guarantees for General Two-sided Sequential Matching Markets
Two-sided markets have become increasingly more important during the las...
read it
-
Segmentation and Optimal Region Selection of Physiological Signals using Deep Neural Networks and Combinatorial Optimization
Physiological signals, such as the electrocardiogram and the phonocardio...
read it
-
Identifying Critical Neurons in ANN Architectures using Mixed Integer Programming
We introduce a novel approach to optimize the architecture of deep neura...
read it
-
Game theoretical analysis of Kidney Exchange Programs
The goal of a kidney exchange program (KEP) is to maximize number of tra...
read it
-
When Nash Meets Stackelberg
We analyze Nash games played among leaders of Stackelberg games (), and ...
read it
-
Nash Games Among Stackelberg Leaders
We analyze Nash games played among leaders of Stackelberg games (NASP). ...
read it
-
A note on the complexity of integer programming games
In this brief note, we prove that the existence of Nash equilibria on in...
read it