-
作者：GRANOT, D; GRANOT, F
摘要：We analyze three subclasses of cooperative games arising from network optimization problems in which the resources, such as arcs or nodes in the network, are controlled by individuals who have conflicting objectives. The first subclass of cooperative games is induced by network optimization problems over directed augmented trees. We show that for this subclass of games the kernel coincides with the nucleolus, and that the nucleolus can be characterized as the unique revenue allocation vector i...
-
作者：RITT, RK; SENNOTT, LI
摘要：The result of Sennott [9] on the existence of optimal stationary policies in countable state Markov decision chains with finite action sets is generalized to arbitrary state space Markov decision chains. The assumption of finite action sets occurring in a global countable action space allows a particularly simple theoretical structure for the general state space Markov decision chain. Two examples illustrate the results. Example 1 is a system of parallel queues with stochastic work requirement...
-
作者：GRANOT, D; GRANOT, F
摘要：We present a computational analysis of a game theoretic approach to a cost allocation problem arising from a graph optimization problem, referred to as the fixed cost spanning forest (FCSF) problem. The customers in the FCSF problem, represented by nodes in a graph G, are in need of service that can be produced at some facilities yet to be constructed. The cost allocation problem is concerned with the fair distribution of the cost of providing the service among customers. We formulate this cos...
-
作者：MAITRA, A; SUDDERTH, W
摘要：We consider the negative dynamic programming model of Strauch [12] and prove that the optimal reward function can be obtained by a transfinite iteration of the optimal reward operator. We show that a player loses nothing by restricting himself to measurable policies, if the returns from nonmeasurable policies are evaluated by lower integrals.
