Equilibrium in a two-agent assignment problem (Q840620)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equilibrium in a two-agent assignment problem |
scientific article |
Statements
Equilibrium in a two-agent assignment problem (English)
0 references
13 September 2009
0 references
Summary: In this paper we address a particular generalisation of the assignment problem (AP) in a multi-agent setting, where distributed agents share common resources. We consider the problem of determining Pareto-optimal solutions that satisfy a fairness criterion (equilibrium). We show that the solution obtained is equivalent to a Kalai-Smorodinsky solution of a suitably defined bargaining problem and characterise the computational complexity of finding such an equilibrium. Additionally, we propose an exact solution algorithm based on a branch-and-bound scheme that exploits bounds obtained by suitably rounding the solutions of the corresponding linear relaxation. Last, we give the results of extensive computational experiments.
0 references
competitive assignment
0 references
equilibrium
0 references
Pareto optimality
0 references
multi-agent systems (MAS)
0 references
agent-based systems
0 references
fairness
0 references