Potential games are a special class of games that admit tractable static and dynamic analysis. Intuitively, games that are "close" to a potential game should enjoy somewh...
Ozan Candogan, Asuman E. Ozdaglar, Pablo A. Parril...
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
Alejandro Allendes, Gabriel R. Barrenechea, Erwin ...
This paper studies the optimal resource allocation in time-reservation systems. Customers arrive at a service facility and receive service in two steps; in the first step informa...
Ran Yang, Sandjai Bhulai, Rob van der Mei, Frank J...
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...