Evaluating Language Models' Evaluations of Games
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911694893088768 |
|---|---|
| author | Collins, Katherine M. Zhang, Cedegao E. Todd, Graham Ying, Lance da Costa, Mauricio Barba Liu, Ryan Sharma, Prafull Weller, Adrian Kuperwajs, Ionatan Wong, Lionel Tenenbaum, Joshua B. Griffiths, Thomas L. |
| author_facet | Collins, Katherine M. Zhang, Cedegao E. Todd, Graham Ying, Lance da Costa, Mauricio Barba Liu, Ryan Sharma, Prafull Weller, Adrian Kuperwajs, Ionatan Wong, Lionel Tenenbaum, Joshua B. Griffiths, Thomas L. |
| contents | Reasoning is not just about solving problems -- it is also about evaluating which problems are worth solving at all. Evaluations of artificial intelligence (AI) systems primarily focused on problem solving, historically by studying how models play games such as chess and Go. In this paper, we advocate for a new paradigm that assesses AI systems' evaluation of games. First, we introduce a formalism for evaluating such evaluations. We then leverage a large-scale dataset of over 100 novel board games and over 450 human judgments to compare evaluations produced by modern language and reasoning models against those of people and symbolic computational agents. We consider two kinds of evaluative queries: assessing the payoff (or fairness) and the funness of games. These queries span two dimensions relevant to the design of evaluations of AI evaluations: how complex a query is to compute and how difficult a query is to quantify. Our results show that reasoning models are generally more aligned to people in their evaluations of games than non-reasoning language models. However, we observe a non-monotonic relationship: as models get closer to game-theoretic optimal, their fit to human data weakens. We also observe more "jaggedness" across models for assessing funness, in line with the greater difficulty of quantifying this query. Across queries and games, reasoning models show highly variable and unpredictable resource usage when assessing queries, pointing to the importance of imbuing more resource-rational meta-reasoning in language and reasoning models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_10930 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Evaluating Language Models' Evaluations of Games Collins, Katherine M. Zhang, Cedegao E. Todd, Graham Ying, Lance da Costa, Mauricio Barba Liu, Ryan Sharma, Prafull Weller, Adrian Kuperwajs, Ionatan Wong, Lionel Tenenbaum, Joshua B. Griffiths, Thomas L. Computation and Language Artificial Intelligence Reasoning is not just about solving problems -- it is also about evaluating which problems are worth solving at all. Evaluations of artificial intelligence (AI) systems primarily focused on problem solving, historically by studying how models play games such as chess and Go. In this paper, we advocate for a new paradigm that assesses AI systems' evaluation of games. First, we introduce a formalism for evaluating such evaluations. We then leverage a large-scale dataset of over 100 novel board games and over 450 human judgments to compare evaluations produced by modern language and reasoning models against those of people and symbolic computational agents. We consider two kinds of evaluative queries: assessing the payoff (or fairness) and the funness of games. These queries span two dimensions relevant to the design of evaluations of AI evaluations: how complex a query is to compute and how difficult a query is to quantify. Our results show that reasoning models are generally more aligned to people in their evaluations of games than non-reasoning language models. However, we observe a non-monotonic relationship: as models get closer to game-theoretic optimal, their fit to human data weakens. We also observe more "jaggedness" across models for assessing funness, in line with the greater difficulty of quantifying this query. Across queries and games, reasoning models show highly variable and unpredictable resource usage when assessing queries, pointing to the importance of imbuing more resource-rational meta-reasoning in language and reasoning models. |
| title | Evaluating Language Models' Evaluations of Games |
| topic | Computation and Language Artificial Intelligence |
| url | https://arxiv.org/abs/2510.10930 |