首页> 外文OA文献 >Computation of Approximate Welfare-Maximizing Correlated Equilibria and Pareto-Optima with Applications to Wireless Communication
【2h】

Computation of Approximate Welfare-Maximizing Correlated Equilibria and Pareto-Optima with Applications to Wireless Communication

机译:近似福利最大化相关平衡和pareto-Optima的计算及其在无线通信中的应用

摘要

In a wireless application with multiple communication links, the data rate of eachudlink is subject to degradation due to transmitting interference from other links. Audcompetitive wireless game then arises as each link acts as a player maximizing itsudown data rate. The game outcome can be evaluated using the solution concept ofudgame equilibria. However, when significant interference among the links arises,uduniqueness of equilibrium is not guaranteed. To select among multiple equilibria,udthe sum of network rate or social welfare is used as the selection criterion. Thisudthesis aims to offer the theoretical foundation and the computational tool for determiningudapproximate correlated equilibria with global maximum expected socialudwelfare in polynomial games. Using sum of utilities as the global objective, weudgive two theoretical and two wireless-specific contributions.ud1. We give a problem formulation for computing near-exact ε -correlated equilibriaudwith highest possible expected social welfare. We then give a sequentialudSemidefinite Programming (SDP) algorithm that computes the solution.udThe solution consists of bounds information on the social welfare.ud2. We give a novel reformulation to arrive at a leaner problem for computingudnear-exact ε -correlated equilibria using Kantorovich polynomials with sparsity.ud3. Forgoing near-exactness, we consider approximate correlated equilibria. Toudaccount for the loss in precision, we introduce the notion of regret. We giveudtheoretical bounds on the regrets at any iteration of the sequential SDP algorithm.udMoreover, we give a heuristic procedure for extracting a discreteudprobability distribution. Subject to players’ acceptance of the regrets, theudcomputed distributions can be used to implement central arbitrators to facilitateudreal-life implementation of the correlated equilibrium concept.ud4. We demonstrate how to compute Pareto-optimal solutions by dropping theudcorrelated equilibria constraints. For demonstration purpose, we focus onlyudon Pareto-optima with equal weights among the players.
机译:在具有多个通信链路的无线应用程序中,每个 udlink的数据速率会由于来自其他链路的传输干扰而降低。然后,竞争竞争的无线游戏出现了,因为每个链接都充当了最大化其数据传输速率的玩家。可以使用 udgame平衡的解决方案概念评估游戏结果。但是,当链接之间出现显着干扰时,则不能保证平衡的唯一性。要在多重均衡中进行选择,以网络费率或社会福利之和作为选择标准。本研究旨在为多项式博弈中确定与全局最大期望社会福利相关的 ud近似相关均衡提供理论基础和计算工具。使用公用事业总和作为全局目标,我们得出两个理论上的贡献和两个特定于无线的贡献。 ud1。我们给出了一个问题公式,用于计算具有尽可能高的预期社会福利的近似精确的ε相关平衡 ud。然后,我们给出了一个顺序 udSemidefinite编程(SDP)算法来计算解决方案。 ud解决方案由有关社会福利的界限信息组成。 ud2。我们给出了一种新颖的公式化公式,以便使用稀疏的Kantorovich多项式来计算 ude精确的ε相关均衡的精简问题。 ud3。放弃近精确性,我们考虑近似的相关均衡。为了弥补精度的损失,我们引入遗憾的概念。在顺序SDP算法的任何迭代中,我们对后悔给出了理论上的界限。 ud此外,我们给出了一种启发式程序,用于提取离散概率分布。在玩家接受后悔的情况下, ud计算的分布可用于实现中央仲裁程序,以促进 udreal生活中实现相关均衡概念。 ud4。我们演示了如何通过删除 udcorrelated平衡约束来计算Pareto最优解。为了演示的目的,我们只关注参与者之间具有相同权重的乌拉圭-帕累托最优。

著录项

  • 作者

    Kong Fook Wai;

  • 作者单位
  • 年度 2012
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号