We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...