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

具有自适应启发式的分布式计算

Distributed Computing with Adaptive Heuristics

Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright

摘要:

我们使用来自分布式计算的思想来研究动态环境,在动态环境中,计算节点或决策者遵循自适应算法(Hart 2005),即,简单和不复杂的行为规则,例如,反复对别人的行为做出“最好的回应”,并最大限度地减少“后悔”,这在博弈论和经济学中得到了广泛的研究。我们探讨当收敛这样简单的动态平衡是保证在异步计算环境中,节点可以在任何时候采取行动。我们的研究议程,分布式计算与自适应算法,位于边缘的计算机科学(包括分布式计算和学习)和博弈论(包括博弈动力学和自适应算法)。我们展示了一个一般的非终止性的结果,广泛的类有界召回-也就是说,简单的行为规则,只依赖于最近的历史节点之间的相互作用。我们认为我们的结果在各种有趣的和及时的应用:博弈论,电路设计,社交网络,路由和拥塞控制的影响。我们还研究了异步动态的计算和通信复杂性,并提出了一些基本的意见,关于无遗憾动态的影响。我们相信我们的工作为分布式计算和博弈论的研究开辟了一条新的途径。

英文摘要:

We use ideas from distributed computing to study dynamic environments in which computational nodes, or decision makers, follow adaptive heuristics (Hart 2005), i.e., simple and unsophisticated rules of behavior, e.g., repeatedly "best replying" to others' actions, and minimizing "regret", that have been extensively studied in game theory and economics. We explore when convergence of such simple dynamics to an equilibrium is guaranteed in asynchronous computational environments, where nodes can act at any time. Our research agenda, distributed computing with adaptive heuristics, lies on the borderline of computer science (including distributed computing and learning) and game theory (including game dynamics and adaptive heuristics). We exhibit a general non-termination result for a broad class of heuristics with bounded recall---that is, simple rules of behavior that depend only on recent history of interaction between nodes. We consider implications of our result across a wide variety of interesting and timely applications: game theory, circuit design, social networks, routing and congestion control. We also study the computational and communication complexity of asynchronous dynamics and present some basic observations regarding the effects of asynchrony on no-regret dynamics. We believe that our work opens a new avenue for research in both distributed computing and game theory.

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

↑