{"id":"2407.06329","title":"Solving Multi-Model MDPs by Coordinate Ascent and Dynamic Programming","url":"https://codeofpaper.com/paper/2407.06329","arxiv_url":"https://arxiv.org/abs/2407.06329","published":"2024-07-08","code":"community","best":{"full_name":"suxh2019/CADP","url":"https://github.com/suxh2019/CADP","tier":"high_confidence_community","stars":0,"license":"MIT","framework":null,"language":"Julia","last_commit":"2026-03-23T13:14:46"},"most_starred_community":null,"implementations":[{"full_name":"suxh2019/CADP","url":"https://github.com/suxh2019/CADP","tier":"high_confidence_community","stars":0,"license":"MIT","framework":null,"language":"Julia","last_commit":"2026-03-23T13:14:46"}],"possible_matches":0}