3 articles tagged with #branch-and-bound. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce MAGR-BB, a novel algorithm that identifies which agents work together and what goals they pursue by analyzing trajectory data alone. The method uses branch-and-bound search with a shared policy model, achieving order-of-magnitude improvements in efficiency while maintaining accuracy comparable to exhaustive search.
Researchers have developed an improved algorithm for computing Nash equilibrium in multiplayer imperfect-information games by deriving tighter variable bounds for nonlinear complementarity problems. This enhancement significantly accelerates spatial branch-and-bound solvers, enabling exact solution of previously intractable game theory problems like three-player Kuhn poker.
Researchers propose BiXDFBnB, a bidirectional depth-first branch-and-bound algorithm that efficiently applies front-to-front heuristics to longest-path problems by adapting the Single-Frontier Bidirectional Search framework. The method reduces computational overhead typically associated with bidirectional frontier management, achieving both fewer node expansions and improved runtime performance on several problem variants.
