메뉴 건너뛰기




Volumn 2008, Issue , 2008, Pages

Cores of cooperative games in information theory

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CYBERNETICS; DECISION MAKING; INFORMATION THEORY; PLANNING; PROGRAMMING THEORY; RESOURCE ALLOCATION; SENSOR NETWORKS; SENSORS; STATISTICAL METHODS;

EID: 48849084177     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/2008/318704     Document Type: Article
Times cited : (32)

References (53)
  • 2
    • 0004260006 scopus 로고    scopus 로고
    • 3rd Boston, Mass, USA Academic Press
    • Owen G., Game Theory 2001 3rd Boston, Mass, USA Academic Press
    • (2001) Game Theory
    • Owen, G.1
  • 3
    • 0001250954 scopus 로고
    • Some applications of the methods of linear programming to the theory of cooperative games
    • Bondareva O. N., Some applications of the methods of linear programming to the theory of cooperative games Problemy Kibernetiki 1963, (Russian) 10 119 139
    • (1963) Problemy Kibernetiki , vol.10 , pp. 119-139
    • Bondareva, O.N.1
  • 9
    • 0000959324 scopus 로고
    • Probabilistic values for games
    • Cambridge, UK Cambridge University Press
    • Weber R. J., Probabilistic values for games The Shapley Value 1988 Cambridge, UK Cambridge University Press 101 119
    • (1988) The Shapley Value , pp. 101-119
    • Weber, R.J.1
  • 10
    • 0001142138 scopus 로고
    • Super-modularity: Applications to convex games and to the greedy algorithm for LP
    • Ichiishi T., Super-modularity: applications to convex games and to the greedy algorithm for LP Journal of Economic Theory 1981 25 2 283 286
    • (1981) Journal of Economic Theory , vol.25 , Issue.2 , pp. 283-286
    • Ichiishi, T.1
  • 19
    • 0016486048 scopus 로고
    • A proof of the data compression theorem of Slepian and Wolf for ergodic sources
    • Cover T. M., A proof of the data compression theorem of Slepian and Wolf for ergodic sources IEEE Transactions on Information Theory 1975 21 2 226 228
    • (1975) IEEE Transactions on Information Theory , vol.21 , Issue.2 , pp. 226-228
    • Cover, T.M.1
  • 20
    • 0018020371 scopus 로고
    • Polymatroidal dependence structure of a set of random variables
    • Fujishige S., Polymatroidal dependence structure of a set of random variables Information and Control 1978 39 1 55 72
    • (1978) Information and Control , vol.39 , Issue.1 , pp. 55-72
    • Fujishige, S.1
  • 21
    • 33746621346 scopus 로고    scopus 로고
    • Low-complexity approaches to Slepian-Wolf near-lossless distributed data compression
    • Coleman T. P., Lee A. H., Médard M., Effros M., Low-complexity approaches to Slepian-Wolf near-lossless distributed data compression IEEE Transactions on Information Theory 2006 52 8 3546 3561
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.8 , pp. 3546-3561
    • Coleman, T.P.1    Lee, A.H.2    Médard, M.3    Effros, M.4
  • 24
    • 0030105018 scopus 로고    scopus 로고
    • A rate-splitting approach to the Gaussian multiple-access channel
    • Rimoldi B., Urbanke R., A rate-splitting approach to the Gaussian multiple-access channel IEEE Transactions on Information Theory 1996 42 2 364 375
    • (1996) IEEE Transactions on Information Theory , vol.42 , Issue.2 , pp. 364-375
    • Rimoldi, B.1    Urbanke, R.2
  • 27
    • 0015667856 scopus 로고
    • A coding theorem for multiple access channels with correlated sources
    • Slepian D., Wolf J. K., A coding theorem for multiple access channels with correlated sources Bell System Technical Journal 1973 52 7 1037 1076
    • (1973) Bell System Technical Journal , vol.52 , Issue.7 , pp. 1037-1076
    • Slepian, D.1    Wolf, J.K.2
  • 28
    • 0018321062 scopus 로고
    • The capacity region of general multiple-access channel with certain correlated sources
    • Han T. S., The capacity region of general multiple-access channel with certain correlated sources Information and Control 1979 40 1 37 60
    • (1979) Information and Control , vol.40 , Issue.1 , pp. 37-60
    • Han, T.S.1
  • 31
    • 0032201980 scopus 로고    scopus 로고
    • Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
    • Tse D. N. C., Hanly S. V., Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities IEEE Transactions on Information Theory 1998 44 7 2796 2815
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.7 , pp. 2796-2815
    • Tse, D.N.C.1    Hanly, S.V.2
  • 36
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • Shannon C. E., A mathematical theory of communication Bell System Technical Journal 1948 27 379 423
    • (1948) Bell System Technical Journal , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 37
    • 0016037985 scopus 로고
    • A simple converse for broadcast channels with additive white Gaussian noise
    • Bergmans P., A simple converse for broadcast channels with additive white Gaussian noise IEEE Transactions on Information Theory 1974 20 2 279 280
    • (1974) IEEE Transactions on Information Theory , vol.20 , Issue.2 , pp. 279-280
    • Bergmans, P.1
  • 38
    • 0019178773 scopus 로고
    • On a source-coding problem with two channels and three receivers
    • Ozarow L., On a source-coding problem with two channels and three receivers Bell System Technical Journal 1980 59 10 1909 1921
    • (1980) Bell System Technical Journal , vol.59 , Issue.10 , pp. 1909-1921
    • Ozarow, L.1
  • 40
    • 0032074619 scopus 로고    scopus 로고
    • The rate-distortion function for the quadratic Gaussian CEO problem
    • Oohama Y., The rate-distortion function for the quadratic Gaussian CEO problem IEEE Transactions on Information Theory 1998 44 3 1057 1070
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.3 , pp. 1057-1070
    • Oohama, Y.1
  • 41
    • 34447344072 scopus 로고    scopus 로고
    • Generalized entropy power inequalities and monotonicity properties of information
    • Madiman M., Barron A., Generalized entropy power inequalities and monotonicity properties of information IEEE Transactions on Information Theory 2007 53 7 2317 2329
    • (2007) IEEE Transactions on Information Theory , vol.53 , Issue.7 , pp. 2317-2329
    • Madiman, M.1    Barron, A.2
  • 44
    • 0001151052 scopus 로고
    • Minimax tests and the Neyman-Pearson lemma for capacities
    • Huber P. J., Strassen V., Minimax tests and the Neyman-Pearson lemma for capacities Annals of Statistics 1973 1 2 251 263
    • (1973) Annals of Statistics , vol.1 , Issue.2 , pp. 251-263
    • Huber, P.J.1    Strassen, V.2
  • 46
    • 0019344851 scopus 로고
    • The rate-distortion function on classes of sources determined by spectral capacities
    • Poor H. V., The rate-distortion function on classes of sources determined by spectral capacities IEEE Transactions on Information Theory 1982 28 1 19 26
    • (1982) IEEE Transactions on Information Theory , vol.28 , Issue.1 , pp. 19-26
    • Poor, H.V.1
  • 47
    • 48849110572 scopus 로고
    • Minimax linear smoothing for capacities
    • Poor H. V., Minimax linear smoothing for capacities Annals of Probability 1982 10 2 504 507
    • (1982) Annals of Probability , vol.10 , Issue.2 , pp. 504-507
    • Poor, H.V.1
  • 48
    • 0022147756 scopus 로고
    • Minimax robust coding for channels with uncertainty statistics
    • Geraniotis E., Minimax robust coding for channels with uncertainty statistics IEEE Transactions on Information Theory 1985 31 6 802 811
    • (1985) IEEE Transactions on Information Theory , vol.31 , Issue.6 , pp. 802-811
    • Geraniotis, E.1
  • 53
    • 0034297879 scopus 로고    scopus 로고
    • A game theoretic framework for bandwidth allocation and pricing in broadband networks
    • Yaïche H., Mazumdar R. R., Rosenberg C., A game theoretic framework for bandwidth allocation and pricing in broadband networks IEEE/ACM Transactions on Networking 2000 8 5 667 678
    • (2000) IEEE/ACM Transactions on Networking , vol.8 , Issue.5 , pp. 667-678
    • Yaïche, H.1    Mazumdar, R.R.2    Rosenberg, C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.