The issue of non-cooperative transceiver optimization in the uplink of a multiuser wireless code division multiple access data network with widely-linear detection at the receiver is considered. While previous work in this area has focused on a simple real signal model, in this paper a baseband complex representation of the data is used, so as to properly take into account the I and Q component...

Cooperative wireless network has drawn the attention of research community since past few years. It has shown potential to be the promising technology for next generation heterogeneous networks. For converting concept into reality, many challenges are to be complied like selection of cooperating partner, mechanism to ensure cooperation, identifying selfish nodes, performance optimization of not...

Uncertainty is a daily presence in the real world. It affects our decision making and may have influence on cooperation. Often uncertainty is so severe that we can only predict some upper and lower bounds for the outcome of our actions, i.e., payoffs lie in some intervals. A suitable game theoretic model to support decision making in collaborative situations with interval data is that of cooper...

The task of understanding coevolutionary algorithms is a very difficult one. These algorithms search landscapes which are in some sense adaptive. As a result, the dynamical behaviors of coevolutionary systems can frequently be even more complex than traditional evolutionary algorithms (EAs). Moreover, traditional EA theory tells us little about coevolutionary algorithms. One major question that...

The Shapley value, one of the most widespread concepts in Operations Research applications of cooperative game theory, was defined and axiomatically characterized in different game-theoretic models. Recently much research work has been done in order to extend OR models and methods, in particular cooperative game theory, for situations with interval data. This paper focuses on the Shapley value ...

Preface This book investigates the classical model of cooperative games with trans-ferable utility (TU-games) and models in which the players have the possibility to cooperate partially, namely fuzzy and multichoice games. In a crisp game the agents are either fully involved or not involved at all in cooperation with some other agents, while in a fuzzy game players are allowed to cooperate with...

Cooperative Models in Action: Simulation of a Nash-Bargaining Model of Household Labor Supply with Taxation Several theoretical contributions, starting with McElroy and Horney (1981) and Manser and Brown (1980), have suggested to model household behavior as a Nash-bargaining game. Since then, very few attempts have been made to operationalize cooperative models of household labor supply for pol...

In games that model cooperative dilemmas, if players are able to choose with whom they will play, they will seek out cooperative partners while escaping free riders. In this paper we recast the problem of selecting with whom to play as a problem of finding the right combination of players. With this approach, we present a model suitable to any n-player game. The model is adaptive and we present...

The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, we propose a solution from cooperative game theory based on the concept of Nash Bargaining Solution. The proposed game theoretical technique is compared ag...

We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. The analysis of the centralized transit price negotiation problem shows that the only one non cooperative equilibrium is when the lowest cost provider takes all the market. The perspective of the game being repeated makes cooperation possible wh...