{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:14:54Z","timestamp":1778670894166,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T00:00:00Z","timestamp":1326240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10458-011-9188-z","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T07:32:47Z","timestamp":1326180767000},"page":"184-201","source":"Crossref","is-referenced-by-count":13,"title":["Fair solutions for some multiagent optimization problems"],"prefix":"10.1007","volume":"26","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,11]]},"reference":[{"issue":"1","key":"9188_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(94)90200-3","volume":"74","author":"M. T. Marsh","year":"1994","unstructured":"Marsh M. T., Schilling D. (1994) Equity measurement in facility location analysis: A review and framework. European Journal of Operational Research 74(1): 1\u201317","journal-title":"European Journal of Operational Research"},{"key":"9188_CR2","doi-asserted-by":"crossref","unstructured":"Lipton R. J., Markakis E., Mossel E., Saberi A. (2004). On approximately fair allocations of indivisible goods. In j. S. Breese, J. Feigenbaum, and M. I. Seltzer (Eds), ACM Conference on Electronic Commerce, ACM (pp. 125\u2013131).","DOI":"10.1145\/988772.988792"},{"issue":"3","key":"9188_CR3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/S0097539703434966","volume":"36","author":"A. Kumar","year":"2006","unstructured":"Kumar A., Kleinberg J. M. (2006) Fairness measures for resource allocation. SIAM Journal on Computing 36(3): 657\u2013680","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"9188_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D. Bertsimas","year":"2011","unstructured":"Bertsimas D., Farias V. F., Trichakis N. (2011) The price of fairness. Operations Research 59(1): 17\u201331","journal-title":"Operations Research"},{"key":"9188_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J. Nash","year":"1950","unstructured":"Nash J. (1950) The bargaining problem. Econometrica 18: 155\u2013162","journal-title":"Econometrica"},{"key":"9188_CR6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.2307\/1914280","volume":"43","author":"E. Kalai","year":"1975","unstructured":"Kalai E., Smorodinsky M. (1975) Other solutions to Nash\u2019s bargaining problem. Econometrica 43: 513\u2013518","journal-title":"Econometrica"},{"key":"9188_CR7","first-page":"475","volume-title":"WINE. Volume 5929 of Lecture Notes in Computer Science","author":"I. Caragiannis","year":"2009","unstructured":"Caragiannis I., Kaklamanis C., Kanellopoulos P., Kyropoulou M. (2009) The efficiency of fair division. In: Leonardi S. (Ed.), WINE. Volume 5929 of Lecture Notes in Computer Science. Springer, Berlin, pp 475\u2013482"},{"key":"9188_CR8","first-page":"26","volume-title":"WINE. Volume 6484 of Lecture Notes in Computer Science","author":"Y. Aumann","year":"2010","unstructured":"Aumann Y., Dombb Y. (2010) The efficiency of fair division with connected pieces. In: Saberi A. (Ed.), WINE. Volume 6484 of Lecture Notes in Computer Science. Springer, Berlin, pp 26\u201337"},{"issue":"4","key":"9188_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00453-005-1177-7","volume":"44","author":"A. Goel","year":"2006","unstructured":"Goel A., Meyerson A. (2006) Simultaneous optimization via approximate majorization for concave profits or convex costs. Algorithmica 44(4): 301\u2013323","journal-title":"Algorithmica"},{"key":"9188_CR10","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D.S. (1979) Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, San Francisco"},{"issue":"1-3","key":"9188_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/B:AMAI.0000034522.25580.09","volume":"42","author":"J. Lang","year":"2004","unstructured":"Lang J. (2004) Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence 42(1-3): 37\u201371","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9188_CR12","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S. Bouveret","year":"2008","unstructured":"Bouveret S., Lang J. (2008) Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research 32: 525\u2013564","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"9188_CR13","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.mathsocsci.2009.05.002","volume":"58","author":"A. Darmann","year":"2009","unstructured":"Darmann A., Klamler C., Pferschy U. (2009) Maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 58(2): 238\u2013250","journal-title":"Mathematical Social Sciences"},{"issue":"1","key":"9188_CR14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.mathsocsci.2010.04.003","volume":"60","author":"A. Darmann","year":"2010","unstructured":"Darmann A., Klamler C., Pferschy U. (2010) A note on maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 60(1): 82\u201385","journal-title":"Mathematical Social Sciences"},{"issue":"1-2","key":"9188_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0167-6377(98)00029-7","volume":"23","author":"G. Dahl","year":"1998","unstructured":"Dahl G. (1998) The 2-hop spanning tree problem. Operations Research Letters 23(1-2): 21\u201326","journal-title":"Operations Research Letters"},{"key":"9188_CR16","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1111\/j.1475-3995.1999.tb00176.x","volume":"6","author":"L. Alfandari","year":"1994","unstructured":"Alfandari L., Paschos V. (1994) Approximating minimum spanning tree of depth 2. International Transactions in Operations Research 6: 607\u2013622","journal-title":"International Transactions in Operations Research"},{"issue":"2","key":"9188_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.orl.2004.05.005","volume":"33","author":"E. Althaus","year":"2005","unstructured":"Althaus E., Funke S., Har-Peled S., K\u00f6nemann J., Ramos E. A., Skutella M. (2005) Approximating k-hop minimum-spanning trees. Operations Research Letters, 33(2): 115\u2013120","journal-title":"Operations Research Letters,"},{"issue":"2-3","key":"9188_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0166-218X(99)00111-0","volume":"93","author":"G. Kortsarz","year":"1999","unstructured":"Kortsarz G., Peleg D. (1999) Approximating the weight of shallow steiner trees. Discrete Applied Mathematics 93(2-3): 265\u2013285","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"9188_CR19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0020-0190(01)00160-0","volume":"80","author":"J. Monnot","year":"2001","unstructured":"Monnot J. (2001) The maximum f-depth spanning tree problem. Information Processing Letters 80(4): 179\u2013187","journal-title":"Information Processing Letters"},{"issue":"1","key":"9188_CR20","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0196-6774(03)00051-8","volume":"48","author":"R. Hassin","year":"2003","unstructured":"Hassin R., Levin A. (2003) Minimum spanning tree with hop restrictions. Journal of Algorithms 48(1): 220\u2013238","journal-title":"Journal of Algorithms"},{"issue":"2","key":"9188_CR21","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1214\/aop\/1176992173","volume":"15","author":"T. P. Hill","year":"1987","unstructured":"Hill T. P. (1987) Partitioning general probability measures. The Annals of Probability 15(2): 804\u2013813","journal-title":"The Annals of Probability"},{"key":"9188_CR22","volume-title":"Multicriteria optimization","author":"M. Ehrgott","year":"2010","unstructured":"Ehrgott M. (2010) Multicriteria optimization. Springer-Verlag, Berlin"},{"issue":"1-3","key":"9188_CR23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(03)00376-1","volume":"310","author":"E. Angel","year":"2008","unstructured":"Angel E., Bampis E., Gourv\u00e8s L. (2008) Approximating the pareto curve with local search for the bicriteria tsp(1, 2) problem. Theoretical Computer Science 310(1-3): 135\u2013146","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9188_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-007-9011-z","volume":"53","author":"B. Manthey","year":"2009","unstructured":"Manthey B., Ram L. S. (2009) Approximation algorithms for multi-criteria traveling salesman problems. Algorithmica 53(1): 69\u201388","journal-title":"Algorithmica"},{"key":"9188_CR25","unstructured":"Manthey B. (2009). On approximating multi-criteria tsp. In S. Albers, J. Y. Marion (Eds.), STACS. Volume 3 of LIPIcs., Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. (pp.637\u2013648), Germany."},{"key":"9188_CR26","unstructured":"Gla\u00dfer C., Reitwie\u00dfner C., Witek M. (2010). Balanced combinations of solutions in multi-objective optimization. CoRR abs\/1007.5475."},{"issue":"1-3","key":"9188_CR27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(03)00288-3","volume":"306","author":"E. Angel","year":"2003","unstructured":"Angel E., Bampis E., Kononov A. (2003) On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoretical Computer Science 306(1-3): 319\u2013338","journal-title":"Theoretical Computer Science"},{"key":"9188_CR28","doi-asserted-by":"crossref","unstructured":"Dongarra J., Jeannot E., Saule E., Shi Z. (2007). Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. In P. B. Gibbons, C. Scheideler (Eds.), SPAA, ACM (pp. 280\u2013288).","DOI":"10.1145\/1248377.1248423"},{"key":"9188_CR29","unstructured":"Ravi R., Goemans M. X. (1996). The constrained minimum spanning tree problem (extended abstract). In R. G. Karlsson, A. Lingas (Eds.), SWAT. Volume 1097 of Lecture Notes in Computer Science (pp. 66\u201375). Springer."},{"key":"9188_CR30","unstructured":"Papadimitriou, C. H., Yannakakis, M. (2000). On the approximability of trade-offs and optimal access of web sources. In: FOCS. (pp. 86\u201392)."},{"issue":"3","key":"9188_CR31","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"S. P. Hong","year":"2004","unstructured":"Hong S. P., Chung S. J., Park B. H. (2004) A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters 32(3): 233\u2013239","journal-title":"Operations Research Letters"},{"issue":"3","key":"9188_CR32","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C. Stein","year":"1997","unstructured":"Stein C., Wein J. (1997) On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters 21(3): 115\u2013122","journal-title":"Operations Research Letters"},{"issue":"12","key":"9188_CR33","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1016\/j.dam.2006.02.008","volume":"154","author":"E. Angel","year":"2006","unstructured":"Angel E., Bampis E., Gourv\u00e8s L. (2006) Approximation algorithms for the bi-criteria weighted max-cut problem. Discrete Applied Mathematics 154(12): 1685\u20131692","journal-title":"Discrete Applied Mathematics"},{"key":"9188_CR34","doi-asserted-by":"crossref","unstructured":"Kouvelis P., Yu G. (1997) Robust discrete optimization and its applications. : Kluwer Academic Publishers,","DOI":"10.1007\/978-1-4757-2620-6"},{"issue":"1","key":"9188_CR35","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1022601301102","volume":"98","author":"G. Yu","year":"1998","unstructured":"Yu G. (1998) Min\u2013max optimization of several classical discrete optimization problems. Journal of Optimization Theory and Applications 98(1): 221\u2013242","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"4-5","key":"9188_CR36","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.tcs.2010.10.006","volume":"412","author":"A. Kasperski","year":"2011","unstructured":"Kasperski A., Zielinski P. (2011) On the approximability of robust spanning tree problems. Theoretical Computer Science 412(4-5): 365\u2013374","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9188_CR37","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H. Aissi","year":"2009","unstructured":"Aissi H., Bazgan C., Vanderpooten D. (2009) Min\u2013max and min\u2013max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research 197(2): 427\u2013438","journal-title":"European Journal of Operational Research"},{"key":"9188_CR38","volume-title":"Combinatorial optimization: Algorithms and complexity","author":"C. H. Papadimitriou","year":"2000","unstructured":"Papadimitriou C. H., Steiglitz K. (2000) Combinatorial optimization: Algorithms and complexity. Dover Publications Inc, Mineola"},{"issue":"2","key":"9188_CR39","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige U., Langberg M. (2001) Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithms 41(2): 174\u2013211","journal-title":"Journal of Algorithms"},{"issue":"3","key":"9188_CR40","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"Johnson D. S. (1974) Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9(3): 256\u2013278","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9188_CR41","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"Kruskal J. B. (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1): 48\u201350","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-011-9188-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-011-9188-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-011-9188-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T08:28:50Z","timestamp":1561192130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-011-9188-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,11]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9188"],"URL":"https:\/\/doi.org\/10.1007\/s10458-011-9188-z","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,11]]}}}