In this two-part paper we present a general framework for addressing the optimal rare control problem in multirate multicast where the objective is the maximization of a social welfare function expressed by the sum of the users’ utility functions. Specifically, we propose a market-based...

In multirate multicast different users in the same multicast group can receive services at different rates depending on their own requirements and the congestion level of the network. In this two-part paper we present a general framework for addressing the optimal rate control problem in...

In multirate multicast different users in the same multicast group can receive services at different rates depending on their own requirements and the congestion level of the network. In this two-part paper we present a general framework for addressing the optimal rate control problem in...

In this two-part paper we present a general framework for addressing the optimal rare control problem in multirate multicast where the objective is the maximization of a social welfare function expressed by the sum of the users’ utility functions. Specifically, we propose a market-based...

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...

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...

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>

We investigate the general multi-armed bandit problem with multiple servers. We determine a condition on the reward processes sufficient to guarantee the optimality of the strategy that operates at each instant of time the projects with the highest Gittins indices. We call this strategy the...

Within the context of games on networks S. Goyal (Goyal (2007), pg. 39) posed the following problem. Under any arbitrary but fixed topology, does there exist at least one pure Nash equilibrium that exhibits a positive relation between the cardinality of a player's set of neighbors and its...

A stationary object is hidden in location i, i=1,2,...,K, with probability p i . 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, so...