Zobrazeno 1 - 10
of 369
pro vyhledávání: '"Shamma, Jeff"'
Autor:
Hamed, Aya, Shamma, Jeff S.
$B$-Matching is a special case of matching problems where nodes can join multiple matchings with the degree of each node constrained by an upper bound, the node's $B$-value. The core solution of a bipartite $B$-matching is both a matching between the
Externí odkaz:
http://arxiv.org/abs/2409.07754
While there are numerous works in multi-agent reinforcement learning (MARL), most of them focus on designing algorithms and proving convergence to a Nash equilibrium (NE) or other equilibrium such as coarse correlated equilibrium. However, NEs can be
Externí odkaz:
http://arxiv.org/abs/2406.08844
We introduce a new class of quadratic functions based on a hierarchy of linear time-varying (LTV) dynamical systems. These quadratic functions in the higher order space can be also seen as a non-homogeneous polynomial Lyapunov functions for the origi
Externí odkaz:
http://arxiv.org/abs/2401.13128
Autor:
Hamed, Aya, Shamma, Jeff S.
In the framework of transferable utility coalitional games, a scoring (characteristic) function determines the value of any subset/coalition of agents. Agents decide on both which coalitions to form and the allocations of the values of the formed coa
Externí odkaz:
http://arxiv.org/abs/2309.06705
This paper considers a single-trajectory system identification problem for linear systems under general nonlinear and/or time-varying policies with i.i.d. random excitation noises. The problem is motivated by safe learning-based control for constrain
Externí odkaz:
http://arxiv.org/abs/2306.10369
Autor:
Toonsi, Sarah A., Shamma, Jeff S.
The framework of multi-agent learning explores the dynamics of how individual agent strategies evolve in response to the evolving strategies of other agents. Of particular interest is whether or not agent strategies converge to well known solution co
Externí odkaz:
http://arxiv.org/abs/2304.04282
A method for constructing homogeneous Lyapunov functions of degree 1 from polynomial invariant sets is presented for linear time varying systems, homogeneous dynamic systems and the class of nonlinear systems that can be represented as such. The meth
Externí odkaz:
http://arxiv.org/abs/2303.02185
This paper considers online switching control with a finite candidate controller pool, an unknown dynamical system, and unknown cost functions. The candidate controllers can be unstabilizing policies. We only require at least one candidate controller
Externí odkaz:
http://arxiv.org/abs/2301.08445
We investigate a novel approach to resilient distributed optimization with quadratic costs in a multi-agent system prone to unexpected events that make some agents misbehave. In contrast to commonly adopted filtering strategies, we draw inspiration f
Externí odkaz:
http://arxiv.org/abs/2207.01346
This paper proposes a novel approach to resilient distributed optimization with quadratic costs in a networked control system (e.g., wireless sensor network, power grid, robotic team) prone to external attacks (e.g., hacking, power outage) that cause
Externí odkaz:
http://arxiv.org/abs/2203.14099