pith. sign in

arxiv: 1801.07140 · v5 · pith:5AEAMAQFnew · submitted 2018-01-22 · 💻 cs.MA

Courtesy as a Means to Coordinate

classification 💻 cs.MA
keywords allocationconventionconvergencecourtesynonyachievesalgorithmsallocations
0
0 comments X
read the original abstract

We investigate the problem of multi-agent coordination under rationality constraints. Specifically, role allocation, task assignment, resource allocation, etc. Inspired by human behavior, we propose a framework (CA^3NONY) that enables fast convergence to efficient and fair allocations based on a simple convention of courtesy. We prove that following such convention induces a strategy which constitutes an $\epsilon$-subgame-perfect equilibrium of the repeated allocation game with discounting. Simulation results highlight the effectiveness of CA^3NONY as compared to state-of-the-art bandit algorithms, since it achieves more than two orders of magnitude faster convergence, higher efficiency, fairness, and average payoff.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.