In Wireless Sensor Networks (WSNs), unlicensed users, that is, sensor nodes, have excessively exploited the unlicensed radio spectrum. Through Cognitive Radio (CR), licensed radio spectra, which are owned by licensed users, can be partly or entirely shared with unlicensed users. This paper proposes a strategic bargaining spectrum-sharing scheme, considering a CR-based heterogeneous WSN (HWSN). ...

We consider a non–cooperative multilateral bargaining game and study an action–dependent bargaining protocol, that is, the probability with which a player becomes the proposer in a round of bargaining depends on the identity of the player who previously rejected. An important example is the frequently studied rejector–becomes–proposer protocol. We focus on subgame perfect equilibria in stationa...

This article establishes the relationship between the static axiomatic theory of bargaining and the sequential strategic approach to bargaining. We consider two strategic models of alternating offers. The models differ in the source of the incentive of the bargaining parties to reach agreement: the bargainers' time preference and the risk of breakdown of negotiation. Each of the models has a un...

We propose a method for the fair and efficient allocation of wireless resources over a cognitive radio system network to transmit multiple scalable video streams to multiple users. The method exploits the dynamic architecture of the Scalable Video Coding extension of the H.264 standard, along with the diversity that OFDMA networks provide. We use a game-theoretic Nash Bargaining Solution (NBS) ...

Roth (1977) axiomatized the Nash (1950) bargaining solution without Pareto optimality, replacing it by strong individual rationality in Nash’s axiom list. In a subsequent work (Roth, 1979) he showed that when strong individual rationality is replaced by weak individual rationality, the only solutions that become admissible are the Nash and the disagreement solutions. In this paper I derive anal...

In computer and communication systems, competition and mutual interactions among users sharing system resources is frequently observed. Typical examples include the sharing of bandwidth in a wireless network or storage capacity in caching systems. In this context, we study different problems, such as load-balancing and proactive resource management in cellular networks, dynamic spectrum access ...

A broad class of 2-person threat games for which a unique pure strategy Nash bargaining solution exists is characterized in terms of three, simple, empirically meaningful restrictions on the joint objective function: compact domain, continuity, and "corner concavity." Connectedness [in particular, convexity] of the strategy and payoff sets is not required. In addition, conditions are given for ...

Strategic or noncooperative bargaining theory provides potentially fruitful microfoundations for the analysis of exchanges in which both sides enjoy pricesetting power. As Rubinstein (1980) demonstrated in his pioneering contribution, invoking a plausible refinement of Cournot-Nash equilibrium makes it possible to derive unique and often intuitively compelling outcomes from given specifications...

We give an axiomatic characterization of the Time-Preference Nash Solution, a bargaining solution that is applied when the underlying preferences are defined over streams of physical outcomes. This bargaining solution is similar to the ordinal Nash solution introduced by Rubinstein, Safra, and Thomson (1992), but it gives a different prediction when the set of physical outcomes is a set of lott...

We consider an n-player bargaining problem where the utility possibility set is compact, convex, and stricly comprehensive. We show that a stationary subgame perfect Nash equilibrium exists, and that, if the Pareto surface is differentiable, all such equilibria converge to the Nash bargaining solution as the length of a time period between offers goes to zero. Without the differentiability assu...