99 citations · 99 across the 2 of their papers we have counts for
2 papers
cs.AI2025
LLM-Powered Preference Elicitation in Combinatorial Assignment
Ermis Soumalias, Yanchen Jiang, Kehang Zhu +3
We study the potential of large language models (LLMs) as proxies for humans to simplify preference elicitation (PE) in combinatorial assignment. While traditional PE methods rely…
cs.AI2012★ 99 cited
Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs
Sven Seuken, Shlomo Zilberstein
Memory-Bounded Dynamic Programming (MBDP) has proved extremely effective in solving decentralized POMDPs with large horizons. We generalize the algorithm and improve its scalabilit…