The set of all possible data rate allocations, which satisfy the constraints (3) and (4), can be characterized by the achievable rate region R : R = { ( R n : n ∈ N ) ∣ R n = f s ∑ k ∈ K b k n ( s k ), n ∈ N, with P n ≤ P n, tot, n ∈ N, and s ∈ S }. (5).
Proof: See Appendix 2. Since the right-hand-side of (31) is independent of λ j ( i ), we propose a simple IWFA to evaluate the optimal power allocation policy which satisfies (31).
(a) A strategy proof and efficient resource allocation strategy, which satisfies the property of intuitive fairness (see Definition 6) is robust to a particular user's scaling down of the utility, when the utilities of all other users are fixed.
The core is the set of all payoff allocation vectors which satisfy the following properties.
For these environments, we fully characterize interim efficient allocation rules which satisfy interim incentive compatibility and interim individual rationality constraints.
For certain interference coupled wireless scenarios we would like to characterize resource allocation strategies, which satisfy certain desirable properties from the axiomatic framework, which can be implemented using mechanisms (see Figure2).
Here we present our results in relation to the restrictions obtained, when we try to obtain strategy proof and efficient resource allocation strategies, which satisfy the property of either.
The scaling factor κ q is chosen such that IP q reaches an acceptable value, after finding a new dynamic allocation of the vector E which satisfies the new constraint.
Now, anything which satisfies PPP satisfies CPP.
