JAIR

869 papers1,338 directions
The Journal of Artificial Intelligence Research (JAIR) is a venue covering a broad spectrum of artificial intelligence and machine learning research. Active since 2003, the journal publishes work that spans theoretical foundations and practical applications. Its scope includes multi-agent interactions, reinforcement learning, and the integration of symbolic logic with neural architectures. Research published in JAIR frequently addresses complex decision-making and strategic depth. Key areas of focus include modeling strategic depth in multi-agent systems, security games involving boundedly rational adversaries, and deceptive rationalization in large reasoning models. The venue also features work on decision-focused learning using differentiable optimization layers and neuro-symbolic architectures designed for sample-efficient learning. Beyond algorithmic development, the journal explores formalisms for quantifying contexts and temporality, as well as procedural and causal fairness in machine learning. Methodological contributions often involve pseudo-likelihood estimation for large graphical models and inconsistency-tolerant reasoning for knowledge bases. Prolific contributors to the venue include researchers such as Jeffrey S. Rosenschein, Joseph M. Barnby, and Alvaro Velasquez, reflecting a community focused on both formal rigor and the evolving challenges of modern AI systems.

Papers by Year

2026 43
2025 63
2024 54
2023 52
2022 75
2021 67
2020 43
2019 31
2018 42
2017 34
2016 37
2015 25
2014 38
2013 24
2012 21
2011 23
2010 18
2009 28
2008 25
2007 20
2006 16
2005 18
2004 16
2003 14
2002 17
2001 6
2000 7
1999 11
1998 4
1997 6
1996 5
1995 11
1994 4
1993 1

Top Research Directions

Research directions most represented by papers from this venue.

Strategyproof Resource Allocation Without Money 12
Managing Combinatorial Explosion in Automated Planning 11
Scaling State Space Search Under Memory Constraints 10
Parameterized Complexity in Computational Social Choice 9
Balancing Logical Expressivity and Computational Tractability 9
Computational Complexity as a Barrier to Election Manipulation 9
The Computational Intractability of Exact Probabilistic Inference 9
Fair Division of Indivisible Resources 8
Sample Efficient Reinforcement Learning 8
Taming the Complexity of Decentralized Multiagent Planning 8
Compressing Belief Spaces for Tractable Partially Observable Planning 8
Point Based Value Iteration for Partially Observable MDPs 7
Balancing Heuristic Accuracy and Computational Cost in Search 7
Scaling Symbolic Reasoning to Large Knowledge Bases 7
Decentralized Coordination Under Partial Observability 7

Top Authors

AuthorPapers
Joseph Halpern18
Moshe Tennenholtz16
Ian Horrocks10
Piotr Faliszewski10
Adnan Darwiche9
Alan Fern9
Bernardo Cuenca Grau9
Frank Hutter9
Milind Tambe9
Mirella Lapata8
Regina Barzilay8
Subbarao Kambhampati8
Carsten Lutz7
Joelle Pineau7
Kai Ming Ting7
Matthijs T. J. Spaan7
Michael J. Wooldridge7
Michael P. Wellman7
Thomas Eiter7
William Yeoh7

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Single Network Relational Transductive Learning2013
The Arcade Learning Environment: An Evaluation Platform for General Agents2013
Topic Segmentation and Labeling in Asynchronous Conversations2013
Toward Supervised Anomaly Detection2013
Undominated Groves Mechanisms2013
Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures2012
A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing2012
Coalition Structure Generation over Graphs2012
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice2012
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth2012
Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction2012
Exploiting Model Equivalences for Solving Interactive Dynamic Influence Diagrams2012
Generating Approximate Solutions to the TTP using a Linear Distance Relaxation2012
Improving Statistical Machine Translation for a Resource-Poor Language Using Related Resource-Rich Languages2012
Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results2012
Learning to Predict from Textual Data2012
Learning to Win by Reading Manuals in a Monte-Carlo Framework2012
Modeling Social Causality and Responsibility Judgment in Multi-Agent Interactions2012
Modelling Observation Correlations for Active Exploration and Robust Object Detection2012
Plan-based Policies for Efficient Multiple Battery Load Management2012
Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach2012
Riffled Independence for Efficient Inference with Partial Rankings2012
Robust Local Search for Solving RCPSP/max with Durational Uncertainty2012
SAS+ Planning as Satisfiability2012
Solving Limited Memory Influence Diagrams2012
Transforming Graph Data for Statistical Relational Learning2012
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization2011
A Monte-Carlo AIXI Approximation2011
Cloning in Elections: Finding the Possible Winners2011
Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling2011
Determining Possible and Necessary Winners Given Partial Orders2011
Efficient Multi-Start Strategies for Local Search Algorithms.2011
Efficient Planning under Uncertainty with Macro-actions2011
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference2011
False-Name Manipulations in Weighted Voting Games2011
Multiagent Learning in Large Anonymous Games2011
Multimode Control Attacks on Elections2011
Multi-Robot Adversarial Patrolling: Facing a Full-Knowledge Opponent2011
Non-Deterministic Policies in Markovian Decision Processes2011
Probabilistic Relational Planning with First Order Decision Diagrams2011
Representing and Reasoning with Qualitative Preferences for Compositional Systems2011
Scaling up Heuristic Planning with Relational Decision Trees2011
Scheduling Bipartite Tournaments to Minimize Total Travel Distance2011
Soft Constraints of Difference and Equality2011
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness2011
The Complexity of Integer Bound Propagation2011
Theoretical and Practical Foundations of Large-Scale Agent-Based Micro-Storage in the Smart Grid2011
Topological Value Iteration Algorithms2011
Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisition2011
Algorithms for Closed Under Rational Behavior (CURB) Sets2010

« prev Page 13/18 next »