on-line algorithm and competitive analysis

A Simple Algorithm for Online Decision Making

  • Rui Chen
  • Oktay Gunluk
  • Andrea Lodi
  • Guanyi Wang
    • Categories Integer Programming, Stochastic Programming Tags , ,

    \(\) Motivated by recent progress on online linear programming (OLP), we study the online decision making problem (ODMP) as a natural generalization of OLP. In ODMP, there exists a single decision maker who makes a series of decisions spread out over a total of \(T\) time stages. At each time stage, the decision maker makes … Read more

    Improved bounds for the symmetric rendezvous search problem on the line

  • Donglei Du
  • Q. Han
  • Juan Vera
  • Luis F. Zuluaga
    • Categories Combinatorial Optimization, Game Theory, Semi-definite Programming Tags , , ,

    A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apart between the two players is 2. We show that the symmetric rendezvous value is within the interval (4.1520, 4.2574), which considerably improves the previous best … Read more