A look back at the core of games in characteristic function form: some new axiomatization results

2022-08-02 · Anindya Bhattacharya

In this paper we provide three new results axiomatizing the core of games in characteristic function form (not necessarily having transferable utility) obeying an innocuous condition (that the set of individually rational pay-off vectors is bounded). One novelty of this exercise is that our domain is the {\em entire} class of such games: i.e., restrictions like "non-levelness" or "balancedness" are not required.

📄 PDF Abstract BibTeX arXiv:2208.01690

Code (0)

등록된 구현이 없습니다.

Tasks

Form

Triadic Werewolf: A Jester Role for Multi-Hop Theory of Mind in LLMs

2026-06-26 · Avni Mittal arxiv

Theory-of-mind evaluations of large language models typically use dyadic social-deduction games, where every observable cue points to a single hidden side, so a model with strong language priors can score well without ev…

Coalitional Games with Stochastic Characteristic Functions and Private Types

2019-10-25 · Dengji Zhao, Yiqing Huang, Liat Cohen, Tal Grinshpoun

The research on coalitional games has focused on how to share the reward among a coalition such that players are incentivised to collaborate together. It assumes that the (deterministic or stochastic) characteristic func…

ProxyWar: Dynamic Assessment of LLM Code Generation in Game Arenas

2026-02-04 · Wenjun Peng, Xinyu Wang, Qi Wu arxiv

Large language models (LLMs) have revolutionized automated code generation, yet the evaluation of their real-world effectiveness remains limited by static benchmarks and simplistic metrics. We present ProxyWar, a novel f…

Code Generation Code Repair

Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark

2021-06-23 · NeurIPS 2021 12 · Stefan O'Toole, Nir Lipovetzky, Miquel Ramirez, Adrian Pearce

We propose new width-based planning and learning algorithms inspired from a careful analysis of the design decisions made by previous width-based planners. The algorithms are applied over the Atari-2600 games and our bes…

Atari Games

Algorithmic Improvements for Deep Reinforcement Learning applied to Interactive Fiction

2019-11-28 · Vishal Jain, William Fedus, Hugo Larochelle, Doina Precup 외

Text-based games are a natural challenge domain for deep reinforcement learning algorithms. Their state and action spaces are combinatorially large, their reward function is sparse, and they are partially observable: the…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+1