Cores of Cooperative Games in Information Theory

  title={Cores of Cooperative Games in Information Theory},
  author={Mokshay M. Madiman},
  journal={EURASIP J. Wireless Comm. and Networking},
Cores of cooperative games are ubiquitous in information theory and arise most frequently in the characterization of fundamental limits in various scenarios involving multiple users. Examples include classical settings in network information theory such as Slepian-Wolf source coding and multiple access channels, classical settings in statistics such as robust hypothesis testing, and new settings at the intersection of networking and statistics such as distributed estimation problems for sensor… CONTINUE READING
Highly Cited
This paper has 57 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 34 extracted citations

57 Citations

Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 49 references

Minimax tests and the Neyman- Pearson lemma for capacities

  • P. J. Huber, V. Strassen
  • Annals of Statistics, vol. 1, no. 2, pp. 251–263…
  • 1973
Highly Influential
5 Excerpts

Cooperative games with large cores

  • W. W. Sharkey
  • International Journal of Game Theory, vol. 11, no…
  • 1982
Highly Influential
3 Excerpts

A note on the exact games

  • M. A. Rabie
  • International Journal of Game Theory, vol. 10, no…
  • 1981
Highly Influential
3 Excerpts

Cores of convex games

  • L. S. Shapley
  • International Journal of Game Theory, vol. 1, no…
  • 1971
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…