Algorithmic Game Theory : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings (Lecture Notes in Computer Science) (2013)

個数:

Algorithmic Game Theory : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings (Lecture Notes in Computer Science) (2013)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 271 p.
  • 言語 ENG
  • 商品コード 9783642413919
  • DDC分類 519.3

Full Description

This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.

Contents

The Complexity of Fully Proportional Representation for Single-Crossing Electorates.- New Results on Equilibria in Strategic Candidacy.- Plurality Voting with Truth-Biased Agents.- Reliability Weighted Voting Games.- The Power of Mediation in an Extended El Farol Game.- Friend of My Friend: Network Formation with Two-Hop Benefit.- Load Rebalancing Games in Dynamic Systems with Migration Costs.- Stochastic Congestion Games with Risk-Averse Players.- Congestion Games with Player-Specific Costs Revisited.- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information.- Anti-coordination Games and Stable Graph Colorings.- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.- Cooperative Equilibria in Iterated Social Dilemmas.- Symmetries of Quasi-Values.- Dividing Connected Chores Fairly.- On Popular Random Assignments.- Scheduling a Cascade with Opposing Influences.- Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games.- Inefficiency of Games with Social Context.- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines.- Imperfect Best-Response Mechanisms.- Pricing Ad Slots with Consecutive Multi-unit Demand.

最近チェックした商品