中文摘要：

为了利用多用户差异，在用户之中从变化导致了隧道条件，高效地分配象副载波，位，和力量那样的资源成为了一个有趣、挑战性的问题。研究专注于以一个集中的方法一起为所有用户解决资源分配问题的电流的大多数，它引起高计算的复杂性并且为真实系统使它不切实际。因此，为在长期的进化(LTE ) 的 downlink 多用户资源分配的一个 coalitional 游戏框架系统被建议，基于 divide-and-conquer 想法。目标是在每个用户的最小的率要求的限制下面最大化全面系统数据率并且最大当在用户之中考虑公平时，播送基础车站的力量。在这个框架，一个 coalitional 形成算法被建议完成最佳的联盟形成，一个二用户的讨价还价算法被设计到在二个用户之间的便宜货隧道赋值。全部的计算复杂性极大地与常规方法比较被减少。模拟结果证明建议算法获得在外套之间的好折衷系统在整个和公平，与最大的率和 max-min 计划相比。

英文摘要：

To take advantage of the multiuser diversity resulted from the variation in channel conditions among the users, it has become an interesting and challenging problem to efficiently allocate the resources such as subcarriers, bits, and power. Most of current research concentrates on solving the resource-allocation problem for all users together in a centralized way, which brings about high computational complexity and makes it impractical for real system. Therefore, a coalitional game framework for downlink multi-user resource allocation in long term evolution （LTE） system is proposed, based on the divide-and-conquer idea. The goal is to maximize the overall system data rate under the constraints of each user＇s minimal rate requirement and maximal transmit power of base station while considering the fairness among users. In this framework, a coalitional formation algorithm is proposed to achieve optimal coalition formation and a two-user bargaining algorithm is designed to bargain channel assignment between two users. The total computational complexity is greatly reduced in comparison with conventional methods. The simulation results show that the proposed algorithms acquire a good tradeoff between the overall system throughout and fairness, compared to maximal rate and max-min schemes.