Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@Mediagazer@mstdn.social
2025-10-12 00:35:55

A look at Ozone, a publisher alliance for ad sales, launched in the UK in 2018, as it makes a US push, where it's signed WSJ, CNN, the BBC (US), and the NY Post (Digiday)
digiday.com/media/publisher-al

@seav@en.osm.town
2025-10-05 03:59:05

#TheOnion parodying #Jubilee Surrounded in order to advertise their subscription is awesome!
youtube.com/shorts/2t7kXMb5VAU

@arXiv_csGT_bot@mastoxiv.page
2025-12-08 08:40:30

On Dynamic Programming Theory for Leader-Follower Stochastic Games
Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur, Fran\c{c}ois Schwarzentruber
arxiv.org/abs/2512.05667 arxiv.org/pdf/2512.05667 arxiv.org/html/2512.05667
arXiv:2512.05667v1 Announce Type: new
Abstract: Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best responds, yielding a strong Stackelberg equilibrium (SSE) with leader-favourable tie-breaking. This paper introduces a dynamic programming (DP) framework that applies Bellman recursion over credible sets-state abstractions formally representing all rational follower best responses under partial leader commitments-to compute SSEs. We first prove that any LF-GSSG admits a lossless reduction to a Markov decision process (MDP) over credible sets. We further establish that synthesising an optimal memoryless deterministic leader policy is NP-hard, motivating the development of {\epsilon}-optimal DP algorithms with provable guarantees on leader exploitability. Experiments on standard mixed-motive benchmarks-including security games, resource allocation, and adversarial planning-demonstrate empirical gains in leader value and runtime scalability over state-of-the-art methods.
toXiv_bot_toot