arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1004.1578cs.GT
收藏

网络公共物品博弈

The Networked Common Goods Game

Jinsong Tan

摘要:

我们引入了一类新的游戏称为网络共同商品游戏(NCGG),它概括了著名的共同商品游戏。我们专注于一个相当一般的子类的游戏中,每个代理的效用函数是相同的所有商品的代理有权和满足某些自然属性(收益递减和平滑)。我们给出了一套全面的技术成果,如下所示。* 我们表明,一个单一的代理所面临的优化问题,可以有效地解决这个子类。然而,离散版本的问题是NP难的,但承认一个完全多项式时间近似计划(FPTAS)。* 我们证明了NCGG纯策略纳什均衡的唯一性结果,并且该均衡完全由网络的结构表征,与代理效用函数的选择和组合无关。* 我们表明NCGG是一个潜在的游戏,并给出了最佳/更好的响应纳什动态,导致快速收敛到一个$ε$ -近似纯策略纳什均衡的实现。* 最后,我们证明了NCGG的无政府代价可能与$Ω(n^{1-ε})$一样大(对于任何$ε>0$),这意味着NCGG中的自私行为可能导致极其低效的社会结果。

英文摘要:

We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game. We focus on a fairly general subclass of the game where each agent's utility functions are the same across all goods the agent is entitled to and satisfy certain natural properties (diminishing return and smoothness). We give a comprehensive set of technical results listed as follows. * We show the optimization problem faced by a single agent can be solved efficiently in this subclass. The discrete version of the problem is however NP-hard but admits an fully polynomial time approximation scheme (FPTAS). * We show uniqueness results of pure strategy Nash equilibrium of NCGG, and that the equilibrium is fully characterized by the structure of the network and independent of the choices and combinations of agent utility functions. * We show NCGG is a potential game, and give an implementation of best/better response Nash dynamics that lead to fast convergence to an $ε$-approximate pure strategy Nash equilibrium. * Lastly, we show the price of anarchy of NCGG can be as large as $Ω(n^{1-ε})$ (for any $ε>0$), which means selfish behavior in NCGG can lead to extremely inefficient social outcomes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑