首页> 外文学位 >Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints.
【24h】

Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints.

机译:具有共享约束的广义Nash游戏:存在性,效率,细化和平衡约束。

获取原文
获取原文并翻译 | 示例

摘要

Four questions are addressed in this thesis with the central theme as shared-constraint games. In the first part of the thesis we present a refinement [MWG95] of the generalized Nash equilibria (GNE). The contribution of this work is a theory that gives sufficient conditions for a game to admit the VE as a refinement of the GNE. These conditions are expressed in terms of the Brouwer degree, which is seen to relate the GNE and the VE in a profound manner. Importantly, for certain classes of games, these conditions are also seen to be necessary. The degree theoretic relationship holds in both, primal and primal-dual space. Our work unifies some previously known results and provides mathematical justification for ideas that were known to be intuitive appealing but were hitherto unsubstantiated formally.;The second part of this thesis is about multi-leader multi-follower games. These games are highly nonconvex and irregular and no reliable theory is available for claiming the existence of equilibria of these games. We develop such a theory for multi-leader multi-follower games with shared constraints. The application of standard fixed point arguments to the reaction map of general multi-leader multi-follower games is hindered by the lack of suitable continuity properties, amongst other requirements, in this map. We observe that these games bear a close resemblance to shared-constraint games and present modifications of the canonical multi-leader multi-follower game that result in shared-constraint games, with far more favorable properties. Specifically, a global equilibrium of this game exists when a suitably defined modified reaction map admits a fixed point.;The third part of thesis concerns the use of variational inequalities for claiming the existence of an equilibrium to shared-constraint games. The equilibrium conditions of a generalized Nash game can be compactly stated as a quasi-variational inequality (QVI), an extension of the variational inequality (VI). Harker [Har91] showed that under certain conditions on the maps defining the QVI, a solution to a related VI solves the QVI. But the application of Harker's result to the QVI associated with shared-constraint games proves difficult because its hypotheses can fail to hold even for simple shared-constraint games. We show these hypotheses are in fact impossible to satisfy in most settings. But we show that for a modified QVI, whose solution set equals that of the original QVI, the hypothesis of Harker's result always hold.;In the fourth part we take a system-level view of shared-constraint games that result from resource allocation. We clarify the relation between this mode of allocating resources and the other conventional modes via either perfect competition or through the use of a mechanism. We find that for perfectly competitive settings the VE is the same as the competitive equilibrium. We then compare the performance of GNE and VE of the shared-constraint game with respect to the system-level objective of maximization of social welfare [MWG95] or aggregate utility. We are specifically interested in the efficiency of an equilibrium, which is the ratio of the aggregate utility for this equilibrium to the optimal aggregate utility, and in the lowest value this efficiency can take for a class of utility functions. We show that for a certain class of utility functions the VEs are fully efficient.;Finally we suggest ways to remedy the low efficiency of equilibria in these cases. We find that a more restricted class of utility functions, in which the gradient map of every member utility function is bounded away from zero and from above uniformly over the domain, gives a more favorable worst case efficiency. We then consider a game where players incur costs that, from the system point of view are not additive, whereby the system problem is not merely the sum of the objectives of all players. We characterize utility functions for which the VE is efficient under this notion of efficiency. Finally we consider the imposition of a reserve price on players. The reserve price has the effect of eliminating players with low interest in the resource. (Abstract shortened by UMI.)
机译:本文以共享约束博弈为中心讨论了四个问题。在论文的第一部分,我们提出了广义纳什均衡(GNE)的细化[MWG95]。这项工作的贡献是为游戏接纳VE作为GNE的改进提供了充分的条件。这些条件用Brouwer程度表示,被认为与GNE和VE有着深远的联系。重要的是,对于某些类别的游戏,也认为这些条件是必要的。程度理论关系在原始空间和原始对偶空间中均成立。我们的工作统一了一些先前已知的结果,并为已知有直觉吸引力但迄今尚未正式证实的思想提供了数学证明。;本文的第二部分是关于多领导者多跟随者游戏。这些博弈是高度非凸且不规则的,并且没有可靠的理论可用来声称这些博弈的均衡性的存在。我们针对共享约束的多领导者多跟随者游戏开发了这种理论。标准定点参数在一般多头多跟随者游戏的反应图中的应用受到阻碍,因为该图中缺少合适的连续性以及其他要求。我们观察到,这些游戏与共享约束游戏非常相似,并且提出了规范的多头多跟随者游戏的修改形式,从而导致了共享约束游戏,并且具有更优越的属性。具体来说,当适当定义的修改后的反应图允许一个固定点时,该博弈的全局平衡就存在。论文的第三部分涉及使用变分不等式来主张共享约束博弈的平衡。广义纳什博弈的平衡条件可以紧凑地表示为准变分不等式(QVI),是变分不等式(VI)的扩展。 Harker [Har91]表明,在定义QVI的地图上的某些条件下,相关VI的解决方案可解决QVI。但是事实证明,将Harker结果应用于与共享约束博弈相关的QVI是困难的,因为即使是简单的共享约束博弈,其假设也无法成立。我们证明了这些假设实际上在大多数情况下是无法满足的。但是我们表明,对于修改后的QVI(其解集等于原始QVI的QVI)而言,Harker结果的假设始终成立。在第四部分中,我们从资源分配产生的共享约束博弈的系统级角度进行了研究。我们通过完全竞争或使用某种机制来阐明这种分配资源的模式与其他常规模式之间的关系。我们发现,对于完全竞争的环境,VE与竞争均衡相同。然后,针对社会福利最大化[MWG95]或总体效用最大化的系统级目标,我们比较了共享约束博弈的GNE和VE的性能。我们对均衡效率特别感兴趣,均衡效率是该均衡的总效用与最佳总效用之比,对于一类效用函数,该效率可以取最小值。我们证明对于某些类的效用函数,VE是完全有效的。最后,我们提出了在这些情况下纠正均衡效率低的方法。我们发现,效用函数的限制更为严格,其中每个成员效用函数的梯度图在整个域上均从零开始并从上方均匀地有界,从而给出了更有利的最坏情况效率。然后,我们考虑一种游戏,在该游戏中,玩家从系统的角度来看所产生的成本不是累加的,因此系统问题不仅仅是所有玩家目标的总和。在这种效率概念下,我们描述了VE有效的效用函数。最后,我们考虑对玩家强加底价。底价具有消除对资源兴趣低的参与者的作用。 (摘要由UMI缩短。)

著录项

  • 作者

    Kulkarni, Ankur A.;

  • 作者单位

    University of Illinois at Urbana-Champaign.;

  • 授予单位 University of Illinois at Urbana-Champaign.;
  • 学科 Applied Mathematics.;Engineering Industrial.;Operations Research.
  • 学位 Ph.D.
  • 年度 2010
  • 页码 177 p.
  • 总页数 177
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号