activity
20172026
most citedThe Computation of Approximate Generalized Feedback Nash Equilibria

34 citations · 123 across the 92 of their papers we have counts for

collaborators

111 papers

cs.MA2026

A Robust Approach to Belief Mismatch in Non-cooperative Dynamic Games

Ryan Park, Li-huan Shen, Jesse Milzman +2

Game-theoretic models are increasingly used to describe multi-agent interactions in control and robotics applications. However, theoretical and computational complexity makes these…

math.CA2026

Arithmetic classification of the Dirichlet eigenvalues for a one-dimensional nonlocal -Laplacian problem

Shingo Takeuchi

We classify the arithmetic nature of the Dirichlet eigenvalues of a homogeneous nonlocal one-dimensional -Laplacian problem with power-type nonlinearity . For ration…

cs.GT2026

Can Play That Game: Online Fitted -Iteration for Continuous-Action Zero-Sum Markov Games with Convex-Concave Function Approximation

Kushagra Gupta, Jingqi Li, Cade Armstrong +4

Zero-sum Markov games arise in a wide variety of sequential decision-making problems such as adversarial learning and planning against modeled uncertainties. However, prior work on…

cs.LG2026

Multi-Fidelity Policy Gradients Stabilize Data-Scarce Reinforcement Learning

Xinjie Liu, Ruihan Zhao, Anirban Chaudhuri +3

Policy gradient methods for on-policy reinforcement learning (RL) can become unstable when expensive, scarce target-domain data yield noisy gradient estimates. We address this chal…

eess.IV2026

Binary Phase Retrieval of Cosine Transforms via Local Curvature Minimization

Ronald Ogden, Shwetadwip Chowdhury, Takashi Tanaka +1

Cosine transforms see frequent use in image and video compression due to their ease of computation and high energy compaction. This has sparked interest within the optics community…

cs.RO2026

Cross-entropy optimization with prioritized constraints

Francisco Roldan Sanchez, Pau de las Heras Molins, David Fridovich-Keil +1

When constraints conflict, an optimizer must determine which requirements to preserve and which to relax. On the one hand, a priority ordering specifies which requirements take pre…

cs.RO2026

Cascaded consensus splitting for multi-branch contingency games

Bastien Lechardoy, Pau de las Heras Molins, Thibault Lahire +4

Contingency games enable agents to anticipate and plan for other agents' hypothetical intents by constructing trajectories with a shared prefix and intent-dependent branches. While…

eess.SY2026

Characterizing Identifiability and Generalization for Inverse Receding-Horizon Linear-Quadratic Regulator Problems

Zhiyuan Jin, Jingqi Li, David Fridovich-Keil

We consider the problem of objective inference in the context of receding-horizon linear-quadratic regulator (LQR). In this setting, we are given sequential state-action observatio…

cs.GT2026

Scaling Chance-Constrained Correlated Equilibrium Computation for Exclusive Resource-Assignment Games

Jaehan Im, Ufuk Topcu, David Fridovich-Keil

The chance-constrained correlated equilibrium concept provides a robust coordination technique for self-interested agents whose costs are uncertain to a central coordinator, but th…

cs.LG2026

Amortized Low-Rank Adaptation for Model-Based Reinforcement Learning

Fernando Palafox, David Fridovich-Keil

World models let agents plan by predicting the consequences of their actions, but changes in the environment can make them inaccurate. We study the problem of adapting a world mode…

cs.GT2026

MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems

David Fridovich-Keil

Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-age…

eess.SY2026

Secure Coordination for Vertiport Sequencing in Advanced Air Mobility

Jaehan Im, Filippos Fotiadis, Ufuk Topcu +1

Advanced air mobility operations will require reliable coordination mechanisms for managing dense traffic near vertiports. However, sequencing decisions may become vulnerable when…

cs.LG2026

Controllability in preference-conditioned multi-objective reinforcement learning

Pau de las Heras Molins, Beyazit Yalcinkaya, Lasse Peters +2

Multi-objective reinforcement learning (MORL) allows a user to express preference over outcomes in terms of the relative importance of the objectives, but standard metrics cannot c…

cs.LG2026

A Flow Matching Algorithm for Many-Shot Adaptation to Unseen Distributions

Tyler Ingebrand, Ruihan Zhao, Kushagra Gupta +3

While generative modeling has achieved remarkable success on tasks like natural language-conditioned image generation, enabling model adaptation from example data points remains a…

cs.LG2026

Scaling Pretrained Representations Enables Label-Free Out-of-Distribution Detection Without Fine-Tuning

Brett Barkley, Preston Culbertson, David Fridovich-Keil

Models trained with deep learning often fail to signal when inputs fall outside their training data manifold, leading to unreliable predictions under distribution shift. Prior work…

cs.LG2026

Neural Operators for Multi-Task Control and Adaptation

David Sewell, Xingjian Li, Stepan Tretiakov +2

Neural operator methods have emerged as powerful tools for learning mappings between infinite-dimensional function spaces, yet their potential in optimal control remains largely un…

cs.GT2026

Scalable Coordination with Chance-Constrained Correlated Equilibria via Reduced-Rank Structure

Jaehan Im, David Fridovich-Keil, Ufuk Topcu

Chance-constrained correlated equilibrium enables coordination of noncooperative agents under cost uncertainty through probabilistic incentive-compatibility guarantees. However, co…

cs.GT2026

Breaking Exponential Complexity in Games of Ordered Preference: A Tractable Reformulation

Dong Ho Lee, Jingqi Li, Lasse Peters +2

Games of ordered preference (GOOPs) model multi-player equilibrium problems in which each player maintains a distinct hierarchy of strictly prioritized objectives. Existing approac…

cs.GT2026

Interleaved Information Structures in Dynamic Games: A General Framework with Application to the Linear-Quadratic Case

Janani S K, Kushagra Gupta, Ufuk Topcu +1

A fundamental problem in noncooperative dynamic game theory is the computation of Nash equilibria under different information structures, which specify the information available to…

eess.SY2026

Linear-Quadratic Gaussian Games with Distributed Sparse Estimation

Tianyu Qiu, Filippos Fotiadis, Xinjie Liu +5

Linear-quadratic Gaussian games provide a framework for modeling strategic interactions in multi-agent systems, where agents must estimate system states from noisy observations whi…

cs.RO2026

Simulation Distillation: Pretraining World Models in Simulation for Rapid Real-World Adaptation

Jacob Levy, Tyler Westenbroek, Kevin Huang +6

Robot learning requires adaptation methods that improve reliably from limited, mixed-quality interaction data. This is especially challenging in long-horizon, contact-rich tasks, w…

cs.GT2026

Chance-Constrained Correlated Equilibria for Robust Noncooperative Coordination

Jaehan Im, Ufuk Topcu, David Fridovich-Keil

Correlated equilibria enable a coordinator to influence the self-interested agents by recommending actions that no player has an incentive to deviate from. However, the effectivene…

eess.SY2026

Noncooperative Virtual Queue Coordination via Uncertainty-Aware Correlated Equilibria

Jaehan Im, David Fridovich-Keil, Ufuk Topcu

Collaborative virtual queueing has been proposed as a mechanism to mitigate airport surface congestion while preserving airline autonomy over aircraft-level pushback decisions. A c…

cs.MA2026

When Should Agents Coordinate in Differentiable Sequential Decision Problems?

Caleb Probine, Su Ann Low, David Fridovich-Keil +1

Multi-robot teams must coordinate to operate effectively. When a team operates in an uncoordinated manner, and agents choose actions that are only individually optimal, the team's…