Equilibrium in a two-agent assignment problem

Giovanni Felici, Mariagrazia Mecoli, Pitu Mirchandani, Andrea Pacifici

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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, and give the results of extensive computational experiments.

Original languageEnglish (US)
Pages (from-to)4-26
Number of pages23
JournalInternational Journal of Operational Research
Volume6
Issue number1
DOIs
StatePublished - 2009
Externally publishedYes

Fingerprint

Assignment problem
Exact solution
Optimal solution
Branch-and-bound
Experiment
Resources
Bargaining problem
Fairness
Kalai-Smorodinsky solution
Computational complexity

Keywords

  • Competitive assignment
  • Equilibrium
  • Pareto-optimality

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Equilibrium in a two-agent assignment problem. / Felici, Giovanni; Mecoli, Mariagrazia; Mirchandani, Pitu; Pacifici, Andrea.

In: International Journal of Operational Research, Vol. 6, No. 1, 2009, p. 4-26.

Research output: Contribution to journalArticle

Felici, Giovanni ; Mecoli, Mariagrazia ; Mirchandani, Pitu ; Pacifici, Andrea. / Equilibrium in a two-agent assignment problem. In: International Journal of Operational Research. 2009 ; Vol. 6, No. 1. pp. 4-26.
@article{fd3afe3dcf294679b73025017b3fbb8f,
title = "Equilibrium in a two-agent assignment problem",
abstract = "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, and give the results of extensive computational experiments.",
keywords = "Competitive assignment, Equilibrium, Pareto-optimality",
author = "Giovanni Felici and Mariagrazia Mecoli and Pitu Mirchandani and Andrea Pacifici",
year = "2009",
doi = "10.1504/IJOR.2009.026241",
language = "English (US)",
volume = "6",
pages = "4--26",
journal = "International Journal of Operational Research",
issn = "1745-7645",
publisher = "Inderscience Enterprises Ltd",
number = "1",

}

TY - JOUR

T1 - Equilibrium in a two-agent assignment problem

AU - Felici, Giovanni

AU - Mecoli, Mariagrazia

AU - Mirchandani, Pitu

AU - Pacifici, Andrea

PY - 2009

Y1 - 2009

N2 - 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, and give the results of extensive computational experiments.

AB - 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, and give the results of extensive computational experiments.

KW - Competitive assignment

KW - Equilibrium

KW - Pareto-optimality

UR - http://www.scopus.com/inward/record.url?scp=66949141156&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=66949141156&partnerID=8YFLogxK

U2 - 10.1504/IJOR.2009.026241

DO - 10.1504/IJOR.2009.026241

M3 - Article

AN - SCOPUS:66949141156

VL - 6

SP - 4

EP - 26

JO - International Journal of Operational Research

JF - International Journal of Operational Research

SN - 1745-7645

IS - 1

ER -