online algorithms

Minimum cost subset selection with two competing agents

  • Gaia Nicosia
  • Ulrich Pferschy
  • Andrea Pacifici
    • Categories Combinatorial Optimization, Game Theory Tags , , , , ,

    We address an optimization problem in which two agents, each with a set of weighted items, compete in order to minimize the total weight of their solution sets. The latter are built according to a sequential game consisting in a fixed number of rounds. In every round each agent submits one item that may be … Read more

    An incremental method for solving convex finite minmax problems

  • Manlio Gaudioso
  • Giovanni Giallombardo
  • Giovanna Miglionico
    • Categories Convex and Nonsmooth Optimization Tags , , , , , ,

    We introduce a new approach to minimizing a function defined as the pointwise maximum over finitely many convex real functions (next referred to as the “component functions”), with the aim of working on the basis of “incomplete knowledge” of the objective function. In fact, a descent algorithm is proposed which does not necessarily require at … Read more