In this paper we study a challenging call center operation problem. The goal of our analysis is to identify an optimal policy for allocating tasks to agents. As a first step, we discuss promising randomized policies and use stochastic approximation for finding the optimal randomized policy when...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...

In this paper we study Markov Decision Process (MDP) problems with the restriction that at decision epochs only a finite number of given Markovian decision rules may be applied. The elements of the finite set of allowed decision rules should be mixed to improve the performance. The set of...