Learning and equilibrium as useful approximations: Accuracy of prediction on randomly selected constant sum games

نویسندگان

  • Alvin E. Roth
  • Robert L. Slonim
  • Greg Barron
چکیده

There is a good deal of miscommunication among experimenters and theorists about how to evaluate a theory that can be rejected by sufficient data, but may nevertheless be a useful approximation. A standard experimental design reports whether a general theory can be rejected on an informative test case. This paper, in contrast, reports an experiment designed to meaningfully pose the question: “how good an approximation does a theory provide on average.” It focuses on a class of randomly selected games, and estimates how many pairs of experimental subjects would have to be observed playing a previously unexamined game before the mean of the experimental observations would provide a better prediction than the theory about the behavior of a new pair of subjects playing this game. We call this quantity the model’s equivalent number of observations, and explore its properties. JEL Classification Numbers C72 · C90 This research was supported by a grant from the U.S. National Science Foundation and the USA–Israel Binational Science Foundation. We are very grateful for helpful conversations with David Budescu, Jerry Busemeyer, Gary Chamberlain, Paul Feigin, Dave Krantz, Jack Porter, Tom Wallsten, Wolfgang Viechtbauer, and Richard Zeckhauser. I. Erev Faculty of Industrial Engineering and Management, Technion, Minerva Center for Cognitive Studies, Haifa 32000, Israel E-mail: [email protected] A. E. Roth (B) Department of Economics, Harvard University, Cambridge, MA, USA E-mail: [email protected] R. L. Slonim Department of Economics, Case Western Reserve University, Cleveland, OH, USA A. E. Roth · G. Barron Harvard Business School, Boston, MA, USA

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithmic Solution of N-Person Games

function is a function which estimates what resulting value Two-person, perfect information, constant sum games have been studied in Artificial Intelligence. This paper opens up the issue of playing n-person games and proposes a procedure for constant sum or non-constant sum games. It is proved that a procedure, max”, locates an equilibrium point given the entire game tree. The minimax procedur...

متن کامل

The effect of using computer games on learning free throw Basketball skill and comparison with skilled and learning pattern

The aim of this experiment was to study the effect of computer game on acquisition and retention of free throw basketball skills (accuracy and pattern) and compare this method with two patterning methods (skilled and learning). 50 high school students age range 15-17 years were selected as a research samples. Subjects after participating in the pretest were divided into 5 equal groups and each ...

متن کامل

Investigating the effectiveness of memory-based computer cognitive games in improving working memory and sustained attention of students with learning disability

Abstract Background and aim: Nowadays, exploring strategies to help students with learning disabilities is one of the areas of interest for many psychologists and researchers. The aim of this study was to evaluate the effectiveness of memory-based computer cognitive games in improving working memory and sustained attention of students with learning disabilities in Arak. Method: The method ...

متن کامل

On minmax theorems for multiplayer games Citation

We prove a generalization of von Neumann’s minmax theorem to the class of separable multiplayer zerosum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix—that is, graphical games in which every edge is a two-player game between its endpoints—in which every outcome has zero total sum of players’ payoffs. Our generalization of the minmax theorem implies convexity of equili...

متن کامل

Competitive Multi-agent Inverse Reinforcement Learning with Sub-optimal Demonstrations

This paper considers the problem of inverse reinforcement learning in zero-sum stochastic games when expert demonstrations are known to be not optimal. Compared to previous works that decouple agents in the game by assuming optimality in expert strategies, we introduce a new objective function that directly pits experts against Nash Equilibrium strategies, and we design an algorithm to solve fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007