Results 41 to 50 of about 163,972 (287)
The Control as Inference (CAI) framework has successfully transformed single-agent reinforcement learning (RL) by reframing control tasks as probabilistic inference problems. However, the extension of CAI to multi-agent, general-sum stochastic games (SGs) remains underexplored, particularly in decentralized settings where agents operate independently ...
Zhiyu Zhao, Haifeng Zhang
openaire +2 more sources
Peptide Sequencing With Single Acid Resolution Using a Sub‐Nanometer Diameter Pore
To sequence a single molecule of Aβ1−42–sodium dodecyl sulfate (SDS), the aggregate is forced through a sub‐nanopore 0.4 nm in diameter spanning a 4.0 nm thick membrane. The figure is a visual molecular dynamics (VMD) snapshot depicting the translocation of Aβ1−42–SDS through the pore; only the peptide, the SDS, the Na+ (yellow/green) and Cl− (cyan ...
Apurba Paul +8 more
wiley +1 more source
Stochastic Parity Games on Lossy Channel Systems [PDF]
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies.
Parosh Aziz Abdulla +3 more
doaj +1 more source
Noncooperative Stochastic Games
We introduce a sequential competitive decision process that is a generalization of noncooperative finite games and of two-person zero-sum stochastic games (hence, of Markovian decision processes). We prove the existence of equilibrium points under criteria of discounted gain and of average gain.
openaire +3 more sources
Nonzero-Sum Stochastic Games [PDF]
This chapter discusses stochastic games. We focus on nonzero-sum games and provide a detailed survey of selected recent results. In Section 1, we consider stochastic Markov games. A correlation of strategies of the players, involving “public signals,” is described, and a correlated equilibrium theorem proved recently by Nowak and Raghavan for ...
Nowak, Andrzej S., Szajowski, Krzysztof
openaire +1 more source
Stochastic Shortest Path Games [PDF]
Summary: We consider dynamic, two-player, zero-sum games where the ``minimizing'' player seeks to drive an underlying finite-state dynamic system to a special terminal state along a least expected cost path. The ``maximizer'' seeks to interfere with the minimizer's progress so as to maximize the expected total cost.
Patek, Stephen D., Bertsekas, Dimitri P.
openaire +1 more source
The study proposes a 1‐bit programmable metasurface based on flip‐disc display, named flip‐disc metasurface (FD‐MTS). This new design enables ultralow energy consumption while maintaining coding patterns. It also exhibits high scalability and multifunctional flexibility.
Jiang Han Bao +8 more
wiley +1 more source
Zero-sum linear quadratic stochastic integral games and BSVIEs [PDF]
This paper formulates and studies a linear quadratic (LQ for short) game problem governed by linear stochastic Volterra integral equation. Sufficient and necessary condition of the existence of saddle points for this problem are derived. As a consequence
Shi, Yufeng, Wang, Tianxiao
core
Zero-Sum Stochastic Games with Partial Information and Average Payoff
We consider discrete time partially observable zero-sum stochastic game with average payoff criterion. We study the game using an equivalent completely observable game.
Saha, Subhamay
core +1 more source
Adaptive Dynamics for Interacting Markovian Processes [PDF]
Dynamics of information flow in adaptively interacting stochastic processes is studied. We give an extended form of game dynamics for Markovian processes and study its behavior to observe information flow through the system.
Ay, Nihat, Sato, Yuzuru
core +2 more sources

