Optimistic manipulation under allocation policy of loser reporting for multi-agent systems

Wei Huang; Chong Huang; Zhi Xu; Youqiang Li; Chao Huang

doi:10.1117/12.2631145

18 March 2022 Optimistic manipulation under allocation policy of loser reporting for multi-agent systems

Wei Huang, Chong Huang, Zhi Xu, Youqiang Li, Chao Huang

Proceedings Volume 12168, International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2021); 121682O (2022) https://doi.org/10.1117/12.2631145
Event: International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2021), 2021, Harbin, China

Abstract

Parallel allocation is one of the most fundamental mechanisms for allocating indivisible objects to agents in a decentralized manner, in which agents are allowed to parallelly report their favorite objects among the remainder according to a policy that is insensitive to agent’s identities. In recent years, algorithmic issues about agent’s manipulations have been investigated, such as the computational complexity of verifying whether a manipulator can obtain a given bundle possibly, and maximizing her utility optimistically. In this paper, we consider the allocation policy of loser reporting, where the allocation process is divided into rounds, in each round, each agent that has obtained the smallest number of objects can report exactly one remaining object, and each reported object is allocated to one of the agents that report it at random. We show that for general additive utilities, under the optimistic assumption (i.e., the manipulator can obtain an object once she reports it), an optimal manipulation can be computed in polynomial time with respect to the number of objects.

Citation Download Citation

Wei Huang, Chong Huang, Zhi Xu, Youqiang Li, and Chao Huang "Optimistic manipulation under allocation policy of loser reporting for multi-agent systems", Proc. SPIE 12168, International Conference on Computer Graphics, Artificial Intelligence, and Data Processing (ICCAID 2021), 121682O (18 March 2022); https://doi.org/10.1117/12.2631145

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Parallel computing

Computer science

Computing systems

Chaos

Electronics

Evolutionary algorithms

Information security

Show All Keywords

Keywords/Phrases

Search In:

Publication Years