Search
Search Results
-
Knapsack Secretary Through Boosting
We revisit the knapsack-secretary problem (Babaioff et al.; APPROX 2007), a generalization of the classic secretary problem in which items have...
-
Prophet secretary through blind strategies
In the classic prophet inequality, a well-known problem in optimal stop** theory, samples from independent random variables (possibly differently...
-
Mathematical Intuition, Deep Learning, and Robbins’ Problem
The present article is an essay about mathematical intuition and Artificial intelligence (A.I.), followed by a guided excursion to Robbins’ Problem...
-
Online algorithms for the maximum k-interval coverage problem
We study the online maximum coverage problem on a target interval, in which, given an online sequence of sub-intervals (which may intersect among...
-
Generative Models in the Problem of Evaluating the Efficiency of Computer Algorithms
The author formulates definitions of computer algorithm efficiency according to a criterion that characterizes accuracy, reliability, performance...
-
Computers As a Novel Mathematical Reality: IV. The Goldbach Problem
AbstractIn this part I pursue the discussion of the role of computers in additive number theroy. I sketch the definitive solution of the ternary =...
-
A New Method for Computing Asymptotic Results in Optimal Stop** Problems
In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold and the probability of success in...
-
A new look at the returning secretary problem
We consider a version of the secretary problem in which each candidate has an identical twin. As in the classical secretary problem, the aim is to...
-
On Generalizations of the Optimal Choice Problem
AbstractIn this paper, we consider generalizations of the optimal choice problem. There is a sequence of n identically distributed random variables...
-
Robust best choice problem
We consider a robust version of the full information best choice problem: there is model uncertainty, represented by a set of priors, about the...
-
Fair Share 111 Problems from Ahmes to Aumann
Kofi Annan, former Secretary General of the United Nations, argued that “We need to create a world that is equitable, that is stable and a world...
-
Score-Based Secretary Problem
In the celebrated “Secretary Problem,” involving n candidates who have applied for a single vacant secretarial position, the employer interviews them...
-
On One Problem of the Optimal Choice of Record Values
Independent random variables X 1 , X 2 , . . . , X n having U ([0, 1])-uniform distribution and upper record values in this set are considered. We study...
-
Special Topic: Optimal Stop** Rules
Optimal stop** rules are developed to maximize a reward or minimize a loss in a martingale framework by stop** the process at the right time....
-
Approximation algorithms for stochastic online matching with reusable resources
We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The...
-
-
Learn from history for online bipartite matching
Motivated by various applications in the online platforms for ride-hailing and crowd-sourcing delivery, we study the edge-weighted online bipartite...
-
Time-Inconsistent Stop** in Discrete Time
We now go on to study a class of time-inconsistent stop** problems in discrete time. We start by defining the concepts of Markovian stop**...
-
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...
