An elimination-based rejection-sampling algorithm with optimistic evaluators identifies target-feasible antichains in monotone co-design problems and propagates bounds compositionally through multigraphs.
Ehrgott,Multicriteria Optimization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A bi-level algorithm adapts scalarization weights online in vector-valued repeated games to obtain sublinear regret bounds and raise convergence to a preferred equilibrium from roughly 50% to 80%.
citing papers explorer
-
Compositional Online Learning for Multi-Objective System Co-Design
An elimination-based rejection-sampling algorithm with optimistic evaluators identifies target-feasible antichains in monotone co-design problems and propagates bounds compositionally through multigraphs.