Partial Cooperation in Multi-agent Local Search

Multi-agent systems usually address one of two forms of interaction. One has completely competitive agents that act selfishly, each maximizing its own gain from the interaction. Auctions and voting scenarios usually assume such agents and follow game theoretic results. The other form of interaction has multiple agents that cooperatively search for some global goal, such as an optimal time slot allocation for all landing aircrafts in an airport.

Authors

• Alon Grubshtein
• Roie Zivan
• Amnon Meisels

Keywords

No keywords are indexed for this paper.