Search
Search Results
-
Simple and fast algorithm for binary integer and online linear programming
In this paper, we develop a simple and fast online algorithm for solving a class of binary integer linear programs (LPs) arisen in general resource...
-
Competition and Recall in Selection Problems
We extend the prophet inequality problem to a competitive setting. At every period, a new realization of a random variable with a known distribution...
-
-
Chromatic Number of the Plane: A Historical Essay
It is natural for one to inquire into the authorship of one’s favorite problem. So, in 1991, I turned to countless articles and books. Some of the...
-
Hunting for superstars
The “superstar economy” is characterized by payoff functions that depend in a discontinuous way on the quality level of the corresponding products...
-
The turbulence theory of P. Wehrlé and G. Dedebant (1934–1948): a forgotten probabilistic approach?
The development of the statistical theory of turbulence mainly take places between 1920 and 1940, in a context where emerging theories in fluid...
-
Iterated full information secretary problem
We consider a full information best-choice problem where an administrator who has only one on-line choice in m consecutive searches has to choose the...
-
-
Improved Online Algorithm for Fractional Knapsack in the Random Order Model
The fractional knapsack problem is one of the classical problems in combinatorial optimization, which is well understood in the offline setting....
-
-
The Power of Amortization on Scheduling with Explorable Uncertainty
In this work, we study a scheduling problem with explorable uncertainty. Each job comes with an upper limit of its processing time, which could be...
-
State Structure
The state structure of the People’s Republic of China is regulated in the constitution. Since it is a one-party autocratic state, the highest...
-
Scheduling with Speed Predictions
Algorithms with predictions is a recent framework that has been used to overcome pessimistic worst-case bounds in incomplete information settings. In...
-
The Generalized Stackelberg Equilibrium of the Two-Person Stop** Game
In modeling the bilateral selection of states of the process, Dynkin (Dokl Akad Nauk USSR 185:241–288, 1969) proposed a two-person game in which...
-
-
Oscillation criteria for stop** near the top of a random walk
Consider the problem of maximizing the probability of stop** with one of the two highest values in a Bernoulli random walk with arbitrary parameter p ...
-
Leeds
We moved to Leeds at the start of August 2016, though we spent the first week of my appointment on a pre-arranged holiday. This was a rather active...
-
State-Owned Enterprises
The history of state-owned enterprises and their characteristics are briefly presented. Economic efficiency is then examined using the indicators of...