{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:17:36Z","timestamp":1761808656654,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Norwegian School Of Economics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given two sets of objects, the integer assignment problem consists of assigning objects of one set to objects in the other set. Traditionally, the goal of this problem is to find an assignment that minimizes or maximizes a measure of efficiency, such as maximization of utility or minimization of cost. Lately, the interest in incorporating a measure of fairness in addition to efficiency has gained importance. This paper studies how to incorporate these two criteria in an integer assignment, using the Jain\u2019s index as a measure of fairness. The original formulation of the assignment problem with this index involves a non-concave function, which renders a non-linear non-convex problem, usually hard to solve. To this aim, we develop two reformulations, where one is based on a quadratic objective function and the other one is based on integer second-order cone programming. We explore the performance of these reformulations in instances of real-world data derived from an application of assigning personnel to projects, and also in instances of randomly generated data. In terms of solution quality, all formulations prove to be effective in finding solutions capturing both efficiency and fairness criteria, with some slight differences depending on the type of instance. In terms of solving time, however, the performances of the formulations differ considerably. In particular, the integer quadratic approach proves to be much faster in finding optimal solutions.<\/jats:p>","DOI":"10.1007\/s10287-023-00477-9","type":"journal-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T05:01:45Z","timestamp":1695358905000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On efficiency and the Jain\u2019s fairness index in integer assignment problems"],"prefix":"10.1007","volume":"20","author":[{"given":"Nahid","family":"Rezaeinia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6953-579X","authenticated-orcid":false,"given":"Julio C.","family":"G\u00f3ez","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Guajardo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"issue":"12","key":"477_CR1","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1287\/mnsc.1120.1549","volume":"58","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas D, Farias VF, Trichakis N (2012) On the efficiency-fairness trade-off. Manag Sci 58(12):2234\u20132250","journal-title":"Manag Sci"},{"key":"477_CR2","doi-asserted-by":"crossref","unstructured":"Bui V-P, Nguyen PX, Nguyen HV, Nguyen V-D, Shin O-S (2019) Optimal user pairing for achieving rate fairness in downlink NOMA networks. In: 2019 International conference on artificial intelligence in information and communication (ICAIIC). IEEE, pp 575\u2013578","DOI":"10.1109\/ICAIIC.2019.8669061"},{"key":"477_CR3","unstructured":"G\u00f3ez JC (2013) Mixed integer second order cone optimization, disjunctive conic cuts: theory and experiments, PhD thesis, Lehigh University"},{"issue":"4","key":"477_CR4","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/LCOMM.2013.021913.130025","volume":"17","author":"C Guo","year":"2013","unstructured":"Guo C, Sheng M, Zhang Y, Wang X (2013) A Jain\u2019s index perspective on $$\\alpha $$-fairness resource allocation over slow fading channels. IEEE Commun Lett 17(4):705\u2013708","journal-title":"IEEE Commun Lett"},{"issue":"5","key":"477_CR5","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1109\/TCOMM.2014.050714.130759","volume":"62","author":"C Guo","year":"2014","unstructured":"Guo C, Sheng M, Wang X, Zhang Y (2014) Throughput maximization with short-term and long-term Jain\u2019s index constraints in downlink OFDMA systems. IEEE Trans Commun 62(5):1503\u20131517","journal-title":"IEEE Trans Commun"},{"key":"477_CR6","volume-title":"A quantitative measure of fairness and discrimination","author":"RK Jain","year":"1984","unstructured":"Jain RK, Chiu D-MW, Hawe WR (1984) A quantitative measure of fairness and discrimination. Eastern Research Laboratory, Digital Equipment Corporation, Hudson"},{"key":"477_CR7","doi-asserted-by":"crossref","unstructured":"Kachroo A, Ozdemir MK, Tekiner-Mogulkoc H (2016) Optimization of LTE radio resource block allocation for maritime channels. In: 2016 IEEE 37th Sarnoff symposium. IEEE, pp 88\u201393","DOI":"10.1109\/SARNOF.2016.7846771"},{"key":"477_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s11047-022-09911-4","volume":"22","author":"L Lai","year":"2022","unstructured":"Lai L, Fiaschi L, Cococcioni M, Deb K (2022) Pure and mixed lexicographic-Paretian many-objective optimization: state of the art. Natural Comput 22:227\u2013242","journal-title":"Natural Comput"},{"key":"477_CR9","doi-asserted-by":"crossref","unstructured":"Lan T, Kao D, Chiang M, Sabharwal A (2010) An axiomatic theory of fairness in network resource allocation. In: Proceedings IEEE INFOCOM","DOI":"10.1109\/INFCOM.2010.5461911"},{"issue":"12","key":"477_CR10","first-page":"6934","volume":"218","author":"J Majumdar","year":"2012","unstructured":"Majumdar J, Bhunia AK (2012) An alternative approach for unbalanced assignment problem via genetic algorithm. Appl Math Comput 218(12):6934\u20136941","journal-title":"Appl Math Comput"},{"key":"477_CR11","first-page":"493","volume":"361","author":"Q Rabbani","year":"2019","unstructured":"Rabbani Q, Khan A, Quddoos A (2019) Modified Hungarian method for unbalanced assignment problem with multiple jobs. Appl Math Comput 361:493\u2013498","journal-title":"Appl Math Comput"},{"key":"477_CR12","first-page":"1","volume":"319","author":"N Rezaeinia","year":"2021","unstructured":"Rezaeinia N, G\u00f3ez JC, Guajardo M (2021) Efficiency and fairness criteria in the assignment of students to projects. Ann Oper Res 319:1\u201319","journal-title":"Ann Oper Res"},{"key":"477_CR13","doi-asserted-by":"crossref","unstructured":"Schwarz S, Mehlf\u00fchrer C, Rupp M (2010) Calculation of the spatial preprocessing and link adaption feedback for 3GPP UMTS\/LTE. In: 2010 Wireless advanced 2010. IEEE","DOI":"10.1109\/WIAD.2010.5544947"},{"key":"477_CR14","doi-asserted-by":"crossref","unstructured":"Schwarz S, Mehlfuhrer C, Rupp M (2011) Throughput maximizing multiuser scheduling with adjustable fairness. In: 2011 IEEE international conference on communications (ICC). IEEE","DOI":"10.1109\/icc.2011.5963489"},{"key":"477_CR15","doi-asserted-by":"crossref","unstructured":"Sediq AB, Gohary RH, Yanikomeroglu H (2012) Optimal tradeoff between efficiency and Jain\u2019s fairness index in resource allocation. In: 2012 IEEE 23rd international symposium on personal, indoor and mobile radio communications-(PIMRC). IEEE, pp 577\u2013583","DOI":"10.1109\/PIMRC.2012.6362851"},{"issue":"7","key":"477_CR16","doi-asserted-by":"publisher","first-page":"3496","DOI":"10.1109\/TWC.2013.061413.121703","volume":"12","author":"AB Sediq","year":"2013","unstructured":"Sediq AB, Gohary RH, Schoenen R, Yanikomeroglu H (2013) Optimal tradeoff between sum-rate efficiency and Jain\u2019s fairness index in resource allocation. IEEE Trans Wirel Commun 12(7):3496\u20133509","journal-title":"IEEE Trans Wirel Commun"},{"issue":"9","key":"477_CR17","doi-asserted-by":"publisher","first-page":"6342","DOI":"10.1109\/TWC.2016.2583421","volume":"15","author":"Z Song","year":"2016","unstructured":"Song Z, Ni Q, Navaie K, Hou S, Wu S, Sun X (2016) On the spectral-energy efficiency and rate fairness tradeoff in relay-aided cooperative OFDMA systems. IEEE Trans Wirel Commun 15(9):6342\u20136355","journal-title":"IEEE Trans Wirel Commun"},{"issue":"4","key":"477_CR18","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/TWC.2017.2667644","volume":"16","author":"F Zabini","year":"2017","unstructured":"Zabini F, Bazzi A, Masini BM, Verdone R (2017) Optimal performance versus fairness tradeoff for resource allocation in wireless systems. IEEE Trans Wirel Commun 16(4):2587\u20132600","journal-title":"IEEE Trans Wirel Commun"},{"issue":"3","key":"477_CR19","doi-asserted-by":"publisher","first-page":"2582","DOI":"10.1109\/TVT.2017.2768574","volume":"67","author":"T Zhou","year":"2017","unstructured":"Zhou T, Liu Z, Zhao J, Li C, Yang L (2017) Joint user association and power control for load balancing in downlink heterogeneous cellular networks. IEEE Trans Veh Technol 67(3):2582\u20132593","journal-title":"IEEE Trans Veh Technol"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00477-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00477-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00477-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T16:12:50Z","timestamp":1699632770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00477-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["477"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00477-9","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"25 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"42"}}