New framework for probabilistic safety shields in MDPs showing impossibility of strong classical guarantees and providing weaker but usable alternatives with offline and online constructions.
A lattice-theoretical fixpoint theorem and its applications
4 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 4representative citing papers
Six Birds Theory defines agents as maintained theory objects with feasible policies that make counterfactual differences, operationalized via ledger feasibility, viability kernels, empowerment, and packaging maps, and tested in ring-world simulations showing distinct separations.
In many-to-many matching markets with contracts and substitutable preferences, the re-equilibration map after population shocks is a join-semilattice homomorphism preserving the firm-optimal stable allocation and creating an opposition of interests between incumbent workers and firms.
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.
citing papers explorer
-
Shields to Guarantee Probabilistic Safety in MDPs
New framework for probabilistic safety shields in MDPs showing impossibility of strong classical guarantees and providing weaker but usable alternatives with offline and online constructions.
-
To Throw a Stone with Six Birds: On Agents and Agenthood
Six Birds Theory defines agents as maintained theory objects with feasible policies that make counterfactual differences, operationalized via ledger feasibility, viability kernels, empowerment, and packaging maps, and tested in ring-world simulations showing distinct separations.
-
Decentralized Re-equilibration and Comparative Statics in Matching Markets with Contracts
In many-to-many matching markets with contracts and substitutable preferences, the re-equilibration map after population shocks is a join-semilattice homomorphism preserving the firm-optimal stable allocation and creating an opposition of interests between incumbent workers and firms.
-
On the enumeration of Tarski fixed points
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.