Sciweavers

ORL
2007
83views more  ORL 2007»
13 years 4 months ago
Large deviations bounds for estimating conditional value-at-risk
In this paper, we prove an exponential rate of convergence result for a common estimator of conditional value-at-risk for bounded random variables. The bound on optimistic deviati...
David B. Brown
ORL
2007
84views more  ORL 2007»
13 years 4 months ago
The price of anarchy in an exponential multi-server
We consider a single multi-server memoryless service station. Servers have heterogeneous service rates. Arrivals are routed to one of the servers, and the routing decisions are no...
Moshe Haviv, Tim Roughgarden
ORL
2007
70views more  ORL 2007»
13 years 4 months ago
Linear dependence of stationary distributions in ergodic Markov decision processes
In ergodic MDPs we consider stationary distributions of policies that coincide in all but n states, in which one of two possible actions is chosen. We give conditions and formulas...
Ronald Ortner
ORL
2007
82views more  ORL 2007»
13 years 4 months ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse
ORL
2007
54views more  ORL 2007»
13 years 4 months ago
A new lower bound for the non-oriented two-dimensional bin-packing problem
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
François Clautiaux, Antoine Jouglet, Joseph...
ORL
2007
66views more  ORL 2007»
13 years 4 months ago
Linear programming with online learning
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
ORL
2007
47views more  ORL 2007»
13 years 4 months ago
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
David P. Williamson, Anke van Zuylen
ORL
2007
102views more  ORL 2007»
13 years 4 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov