Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it ...
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...