Reachability games for optimal multi-agent scheduling of tasks with variable durations

DOI10.1007/978-3-030-64843-5_11MaRDI QIDQ2692213zbMATH OpenOpenAlexFDO

Authors Dhananjay Raju, Niklas Lauffer, Ufuk Topcu

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64843-5_11

zbMATH Keywords

graph gameslinear optimization criteriamulti-agent schedulingschedulabilityvariable durations

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited in

(3)

• Stochastic scheduling games with Markov decision arrival processes
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Alternating Reachability Games with Behavioral and Revenue Objectives

This page was built for publication: Reachability games for optimal multi-agent scheduling of tasks with variable durations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692213)