13
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Imperfect best-response mechanisms

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Best-response mechanisms (Nisan, Schapira, Valiant, Zohar, 2011) provide a unifying framework for studying various distributed protocols in which the participants are instructed to repeatedly best respond to each others' strategies. Two fundamental features of these mechanisms are convergence and incentive compatibility. This work investigates convergence and incentive compatibility conditions of such mechanisms when players are not guaranteed to always best respond but they rather play an imperfect best-response strategy. That is, at every time step every player deviates from the prescribed best-response strategy according to some probability parameter. The results explain to what extent convergence and incentive compatibility depend on the assumption that players never make mistakes, and how robust such protocols are to "noise" or "mistakes".

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          The Statistical Mechanics of Strategic Interaction

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The Evolution of Conventions

            H. Young (1993)
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Subjectivity and correlation in randomized strategies

                Bookmark

                Author and article information

                Journal
                03 August 2012
                2014-01-31
                Article
                1208.0699
                722db91e-44e4-45c1-a07c-ea5069d26890

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                In the conference version of this work, we claimed that in a modified version of PageRank games, there exists a subgame which is a potential game and thus our results can be used to obtain a good approximation of the logit dynamics for these games. Unfortunately, this claim was wrong and the logit dynamics for this subgame is in general not easy to analyze
                cs.GT cs.CC

                Comments

                Comment on this article