The paper presents the bargaining model in which preferences of each player are expressed by the sequence of bargaining costs varying in time. There are theorems describing subgame perfect equilibria for some models with the bargaining costs varying in time. In the class of strategies...

In this paper, we introduce a more general form of vector equilibrium problems with a moving ordering cone and set-valued mappings, and obtain some existence theorems for generalized vector equilibrium problems, which extend and unify some existence results for similar problems. Copyright...

A class of cooperative games arising from shortest path problems is defined. These shortest path games are totally balanced and allow a population-monotonic allocation scheme. Possible methods for obtaining core elements are indicated; first, by relating to the allocation rules in taxation and...

This work concerns finte-state Markov decision chains endowed with the long-run average reward criterion. Assuming that the optimality equation has a solution, it is shown that a nearly optimal stationary policy, as well as an approximation to the optimal average reward within a specified error,...

We present an approach to the admission control, resource allocation and routing problem in connection-oriented networks that offer multiple services to users. Users' preferences are summarized by means of their utility functions, and each user is allowed to request more than one type of...

According to the work of Faigle [3] a static Shapley value for games on matroids has been introduced in Bilbao, Driessen, Jiménez-Losada and Lebrón [1]. In this paper we present a dynamic Shapley value by using a dynamic model which is based on a recursive sequence of static models. In this...

We give a closed-form expression for the long-run average cost and the bias vector in a two-class exponential preemptive resume priority queue with holding and switching costs. The bias vector is the sum of a quadratic function of the number of customers in each priority class and an exponential...

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms...

operating under the triadic (0,Q, N,M) policy, where L is the maximum number of customers in the system. The number of working servers can be adjusted one at a time at arrival epochs or at service completion epochs depending on the number of customers in the system. Analytic closed-form...

In this paper, we deal with a multicriteria competitive Markov decision process. In the decision process there are two decision makers with a competitive behaviour, so they are usually called players. Their rewards are coupled because depend on the actions chosen by both players in each state of...