Learn More
For over a decade, the Nash bargaining solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing properties, it has recently been used for assigning bandwidth in a general topology network between applications that have linear utility functions. In this paper, we use this concept for(More)
— Recent mobile equipment (as well as the norm IEEE 802.21) offers the possibility for users to switch from one technology to another (vertical handover). This allows flexibility in resource assignments and, consequently, increases the potential throughput allocated to each user. In this paper, we design a fully distributed algorithm based on trial and(More)
— In this work we consider allocation games and we investigate the following question: under what conditions does the replicator dynamics select a pure strategy? By definition, an allocation game is a game such that the payoff of a player when she takes an action only depends on the set of players who also take the same action. Such a game can be seen as a(More)
—In this paper, we present a fully decentralized algorithm for fair resource sharing between multiple bag-of-tasks applications in a grid environment. This algorithm is inspired from related work on multi-path routing in communication network. An interesting feature of this algorithm is that it allows the choice of wide variety of fairness criteria and(More)
— In third generation mobile networks, transmission rates can be assigned to both real time and non real time applications. We address in this paper the question of how to allocate transmission rates in a manner that is both optimal and fair. As optimality criterion we use the Pareto optimality notion, and as fairness criterion we use a general concept of(More)
— Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of K non-cooperative schedulers using the optimal strategy that maximize their efficiency while fairness is ensured at a system level ignoring applications characteristics. We limit our study to simple(More)
— This paper presents an algorithm for resource allocation in satellite networks 1. It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under interference constraints. Our objective is to maximize the system throughput while guaranteeing that the different types of demands are satisfied, each type using a(More)
— There are several approaches of sharing resources among users. There is a noncooperative approach wherein each user strives to maximize its own utility. The most common optimality notion is then the Nash equilibrium. Nash equilibria are generally Pareto inefficient. On the other hand, we consider a Nash equilibrium to be fair as it is defined in a context(More)
We model the relationship between capacity, Quality of Service (QoS) and offered prices of service providers in a competitive network services market. Capacity and QoS are linked through simple queueing formulae while QoS and price are coupled through distributions on customer preferences. We study the sensitivity of market share of providers to price,(More)
—In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-class mobile ad hoc network (MANET). This is an improvement over the famed Ad-Hoc On-demand Distance Vector (AODV) protocol, that computes the routes with minimal number of hops for(More)