In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a

the destination terminal. We develop performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading, focusing on the high signal-to-noise ratio (SNR) regime. Except for fixed decode-and-forward, all of our cooperative diversity

Abstract—We investigate the influence of different electron-to-hole mobility ratios on the performance of a P3HT:PCBM bulk heterojunction organic solar cell by numerical simulations. We show that using a ratio between electron and hole mobility higher than one, in some particular mobility cases

Abstract-This paper studies optimum signal combining for space diver-sity reception in cellular mobile radio systems. With optimum combining, the signals received by the antennas are weighted and combined to maxi-mize the output signal-to-interference-plus-noise ratio. Thus, with cochan-ne1

different from the centrally enforced optimum. We study the quality of the best Nash equilibrium, and refer to the ratio of its cost to the optimum network cost as the price of stability. The best Nash equilibrium solution has a natural meaning of stability in this context — it is the optimal solution

polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer

Abstract not found

vertex. Besides giving the best known approximation ratio in terms of n, this marks the first nontrivial approximation result as a function of the maximum degree ⌬. This result can be generalized to k-colorable graphs to obtain a coloring using min{O(⌬ 1Ϫ2/k log 1/2 ⌬ log n), O(n 1Ϫ3/(kϩ1) log 1/2 n

Abstract-This paper considers the optimum method for locating a sync word periodically imbedded in binary data and received over the additive white Gaussian noise channel. It is shown that the optimum rule is to select the location that maximizes the sum of the correlation and a correction term

to the analysis window (which is used in the windowed Fourier transform). It is shown that the resemblance can already be reached for a rather small degree of oversampling, if the sampling distances in the time and frequency directions are properly chosen. A procedure is presented with which the optimum ratio