Abstract
Multi-Agent resource allocation has also become a research hotspot in the field of artificial intelligence in recent years. A lot of related work aims to design a procedural resource allocation system with execution efficiency. This paper Studied a parallel allocation method for allocating indivisible items between agents in which every agent asks for an object among those that re-main in every round, and every reported item will be allocated randomly to an agent reporting it. In order to depicts the entire distribution process, the authors propose a method of constructing a game tree of parallel allocation. Study the corresponding relationship between the total number of branches of the game tree and items. In the last part, prof the parallel allocation mechanism is dynamic game and show that the subgame perfect Nash equilibrium (SPNE) can be found by backward introduction the game trees. Provides a method to compute the unique subgame perfect Nash equilibrium in linear time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
