Overlapping Multi-Bandit Best Arm Identification

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (25)

Page 2 sur 2

On the configuration LP for maximum budgeted allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Aleksander Madry

We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer Heidelberg2015

Strong LP formulations for scheduling splittable jobs on unrelated machines

Ola Nils Anders Svensson

A natural extension of the makespan minimization problem on unrelated machines is to allow jobs to be partially processed by different machines while incurring an arbitrary setup time. In this paper we present increasingly stronger LP-relaxations for this ...

Springer Heidelberg2015

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

A Situated and Embodied Approach to Service-oriented Modeling

Anshuman Bahadur Saxena

[Context] As opposed to the traditional approach to problem solving, which limits the scope of the solution to the stated problem, the mandate for services is to go deeper and focus on the value that the proposed solution creates for the entities affected ...

EPFL2014

Path-following gradient-based decomposition algorithms for separable convex optimization

Quoc Tran Dinh

A new decomposition optimization algorithm, called path-following gradient-based decomposition, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this algorithm does not require ...

Springer Verlag2014