A stationary object is hidden in location i, i=1,2,...,K, with probability p <Subscript> i </Subscript>. There are M sensors available and each location can be searched by at most one sensor at each instant of time. Each search of a location takes one unit of time and is conducted independently of previous searches,...</subscript>

In this note we show that the mathematical tools of cooperative game theory allow a successful approach to the statistical problem of estimating a density function. Specifically, any random sample of an absolutely continuous random variable determines a transferable utility game, the Shapley...

The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases...

We associate to each cost spanning tree problem a non-cooperative game, which is inspired by a real-life problem. We study the Nash equilibria and subgame perfect Nash equilibria of this game. We prove that these equilibria are closely related with situations where agents connect sequentially to...

We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks’ customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among...

We extend the duality approach developed by Kramkov and Schachermayer (1999) to cover the case of a general financial framework that includes models with some “imperfection”, such as constrained proportion portfolios, labor income, random endowment and large investor. General objective...

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an...

A given number of n applicants are to be interviewed for a position of secretary. They present themselves one-by-one in random order, all n! permutations being equally likely. Two players I and II jointly interview the i-th applicant and observe that his (or her) relative rank is y for I and z...

We deal with a cost-allocation problem arising from sharing a medical service in the presence of queues. We use a standard queuing theory model in a context of several medical procedures, a certain demand for treatment and a maximum average waiting-time guaranteed by the government. We show that...

We study cooperation structures with the following property: given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. TU-games restricted by union stable systems generalize graph-restricted games and games with permission structures. A study about...