MathDB3 problems
- 0 votes0 replies0 views
Equal-SINR conjecture for the Pareto-optimal power allocation
Equal-SINR conjecture. The Pareto-optimal solution occurs when all users achieve the same SINRs, .
- 0 votes0 replies0 views
The conjecture that scheduling reduces but does not eliminate the FPC gain
FPC scheduling-gain conjecture. The gain from FPC should be smaller but non-zero for most any sensible scheduling policy.
- 0 votes0 replies0 views
Unique Nash equilibrium conjecture for successive-interference-cancellation CDMA
Unique-equilibrium conjecture. The non-cooperative game admits a unique Nash equilibrium point (p_k^*,\text{\boldmath d}_k^*), for .