Multiagent Scheduling Problems

Featured Image

Why is it important?

This chapter presents the basics of a structured combinatorial approach to scheduling problems in which a multiplicity of decision makers must share a common processing resource. We claim that this approach can be used to compute various kinds of compromise solutions, and can therefore be useful in negotation processes among different agents.