tailieunhanh - Báo cáo hóa học: " Research Article Cores of Cooperative Games in Information Theory"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Cores of Cooperative Games in Information Theory | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2008 Article ID 318704 12 pages doi 2008 318704 Research Article Cores of Cooperative Games in Information Theory Mokshay Madiman Department of Statistics Yale University 24 Hillhouse Avenue New Haven CT 06511 USA Correspondence should be addressed to Mokshay Madiman Received 2 September 2007 Revised 18 December 2007 Accepted 3 March 2008 Recommended by Liang-Liang Xie 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 networks. Cooperative game theory allows one to understand aspects of all these problems from a fresh and unifying perspective that treats users as players in a game sometimes leading to new insights. At the heart of these analyses are fundamental dualities that have been long studied in the context of cooperative games for information theoretic purposes these are dualities between information inequalities on the one hand and properties of rate capacity or other resource allocation regions on the other. Copyright 2008 Mokshay Madiman. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. 1. INTRODUCTION A central problem in information theory is the determination of rate regions in data compression problems and that of capacity regions in communication problems. Although single-letter characterizations of these regions were given .