A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable. A central goal is to maximize social welfare of such allocations, which can be measured in terms of the sum of utilities realized by the agen...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of mathematics and artificial intelligence Ročník 68; číslo 1-3; s. 65 - 90
Hlavní autoři:	Nguyen, Trung Thanh, Roos, Magnus, Rothe, Jörg
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Dordrecht Springer Netherlands 01.07.2013 Springer Nature B.V
Témata:	Agents (artificial intelligence) Artificial Intelligence Bundles Complex Systems Computer Science Focusing Mathematical models Mathematics Multiagent systems Optimization Reagents Resource allocation Utilities 68T99 Computational social choice Approximability 68Q17 Social welfare optimization Multiagent resource allocation
ISSN:	1012-2443, 1573-7470
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable. A central goal is to maximize social welfare of such allocations, which can be measured in terms of the sum of utilities realized by the agents ( utilitarian social welfare ), in terms of their minimum ( egalitarian social welfare ), and in terms of their product ( Nash product social welfare ). Unfortunately, social welfare optimization is a computationally intractable task in many settings. We survey recent approximability and inapproximability results on social welfare optimization in multiagent resource allocation, focusing on the two most central representation forms for utility functions of agents, the bundle form and the k-additive form . In addition, we provide some new (in)approximability results on maximizing egalitarian social welfare and social welfare with respect to the Nash product when restricted to certain special cases.
AbstractList	Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable. A central goal is to maximize social welfare of such allocations, which can be measured in terms of the sum of utilities realized by the agents ( utilitarian social welfare ), in terms of their minimum ( egalitarian social welfare ), and in terms of their product ( Nash product social welfare ). Unfortunately, social welfare optimization is a computationally intractable task in many settings. We survey recent approximability and inapproximability results on social welfare optimization in multiagent resource allocation, focusing on the two most central representation forms for utility functions of agents, the bundle form and the k-additive form . In addition, we provide some new (in)approximability results on maximizing egalitarian social welfare and social welfare with respect to the Nash product when restricted to certain special cases. Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable. A central goal is to maximize social welfare of such allocations, which can be measured in terms of the sum of utilities realized by the agents (utilitarian social welfare), in terms of their minimum (egalitarian social welfare), and in terms of their product (Nash product social welfare). Unfortunately, social welfare optimization is a computationally intractable task in many settings. We survey recent approximability and inapproximability results on social welfare optimization in multiagent resource allocation, focusing on the two most central representation forms for utility functions of agents, the bundle form and the k-additive form. In addition, we provide some new (in)approximability results on maximizing egalitarian social welfare and social welfare with respect to the Nash product when restricted to certain special cases.
Author	Roos, Magnus Rothe, Jörg Nguyen, Trung Thanh
Author_xml	– sequence: 1 givenname: Trung Thanh surname: Nguyen fullname: Nguyen, Trung Thanh organization: Institut für Informatik, Heinrich-Heine-Univ. Düsseldorf – sequence: 2 givenname: Magnus surname: Roos fullname: Roos, Magnus email: roos@cs.uni-duesseldorf.de organization: Institut für Informatik, Heinrich-Heine-Univ. Düsseldorf – sequence: 3 givenname: Jörg surname: Rothe fullname: Rothe, Jörg organization: Institut für Informatik, Heinrich-Heine-Univ. Düsseldorf
BookMark	eNp9kU1rJCEQhmVJYPP1A3IT9pJLJ6V2t_YxhHwsBPaSnMWxdXBwdFbtJJP983FmFgIDyUmxnkeq3jpGByEGg9A5gUsCwK8ygZbTBghtBkZF0_5AR6TjrOEth4N631Ro27Kf6DjnBQAMveiP0L9rnKf0YtY4WqxWqxTf3FLNnHdljVUYsQv7r8nkyZeMbUw4R-2Ux6_GW5UMjqvilu5dFRdDNfGygk7NTSgbK05JG6y8j3pLnKJDq3w2Z__PE_R8d_t089A8_rn_fXP92OiWdKXRYuyZ5b2F0fJuFJ0wPR96zfux0zPRwmAHxWCkTM3oqOtoQI3gRkHViWbsBF3s_q1z_J1MLnLpsjbeq2DilCXpoGc1Jy4q-msPXdSuQ-1O0oEIMnQgukrxHaVTzDkZK7Ur25FKUs5LAnKzFLlbiqzRy81SZFtNsmeuUk02rb916M7JlQ1zkz57-lr6AElNo1o
CitedBy_id	crossref_primary_10_1016_j_procs_2017_08_177 crossref_primary_10_2139_ssrn_4456478 crossref_primary_10_1007_s10472_014_9435_5 crossref_primary_10_1007_s00355_017_1075_3 crossref_primary_10_1145_3355902 crossref_primary_10_3233_AIC_190613 crossref_primary_10_1007_s10472_019_09659_1 crossref_primary_10_1145_3485006 crossref_primary_10_1007_s10472_014_9422_x crossref_primary_10_1016_j_artint_2025_104335 crossref_primary_10_1016_j_tcs_2021_03_027 crossref_primary_10_1007_s10458_018_9393_0 crossref_primary_10_1016_j_tre_2014_11_007 crossref_primary_10_1186_s40537_025_01249_9 crossref_primary_10_1137_15M1053682
Cites_doi	10.1145/1109557.1109624 10.1007/s10479-008-0335-0 10.1145/321941.321951 10.1007/978-3-540-24777-7 10.1145/988772.988792 10.1007/BF02392825 10.1137/0206049 10.1007/978-3-642-68874-4_10 10.1145/352871.352872 10.1017/CBO9780511800481.013 10.1145/501158.501161 10.1016/S0167-6377(96)00055-7 10.1145/1064009.1064013 10.1145/336992.337016 10.1016/0167-6377(92)90004-M 10.1145/502090.502098 10.1016/S0165-0114(97)00168-1 10.1137/0603019 10.1137/1.9781611973068.59 10.1137/070680977 10.1145/1120680.1120683 10.1007/978-3-662-04565-7 10.1007/978-3-642-15117-0_9 10.1007/s00453-007-9105-7 10.1145/7531.7535 10.1002/nav.3800020109 10.1016/j.artint.2005.01.006 10.1007/BF01585745 10.1145/1109557.1109675 10.1137/080723491 10.1287/moor.1090.0436
ContentType	Journal Article
Copyright	Springer Science+Business Media Dordrecht 2013 Springer Science+Business Media Dordrecht 2013.
Copyright_xml	– notice: Springer Science+Business Media Dordrecht 2013 – notice: Springer Science+Business Media Dordrecht 2013.
DBID	AAYXX CITATION 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS 7SC 8FD L7M L~C L~D
DOI	10.1007/s10472-012-9328-4
DatabaseName	CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Computer and Information Systems Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer Science Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science
EISSN	1573-7470
EndPage	90
ExternalDocumentID	10_1007_s10472_012_9328_4
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV KOW LAK LLZTM M4Y M7S MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z81 Z83 Z88 Z92 ZMTXR ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 8FE 8FG AZQEC DWQXO GNUQQ JQ2 L6V P62 PKEHL PQEST PQQKQ PQUKI PRINS 7SC 8FD L7M L~C L~D PUEGO
ID	FETCH-LOGICAL-c415t-c8d63f76f0df75d858e6796c76d5cb8409f9a30d23ab2dc00002e87ea04151c33
IEDL.DBID	RSV
ISICitedReferencesCount	35
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000328831600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1012-2443
IngestDate	Wed Oct 01 13:07:20 EDT 2025 Wed Nov 05 14:46:36 EST 2025 Sat Nov 29 05:14:35 EST 2025 Tue Nov 18 22:36:42 EST 2025 Fri Feb 21 02:26:56 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1-3
Keywords	68T99 Computational social choice Approximability 68Q17 Social welfare optimization Multiagent resource allocation
Language	English
License	http://www.springer.com/tdm
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c415t-c8d63f76f0df75d858e6796c76d5cb8409f9a30d23ab2dc00002e87ea04151c33
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
PQID	2918195085
PQPubID	2043872
PageCount	26
ParticipantIDs	proquest_miscellaneous_1506374778 proquest_journals_2918195085 crossref_citationtrail_10_1007_s10472_012_9328_4 crossref_primary_10_1007_s10472_012_9328_4 springer_journals_10_1007_s10472_012_9328_4
PublicationCentury	2000
PublicationDate	2013-07-01
PublicationDateYYYYMMDD	2013-07-01
PublicationDate_xml	– month: 07 year: 2013 text: 2013-07-01 day: 01
PublicationDecade	2010
PublicationPlace	Dordrecht
PublicationPlace_xml	– name: Dordrecht
PublicationTitle	Annals of mathematics and artificial intelligence
PublicationTitleAbbrev	Ann Math Artif Intell
PublicationYear	2013
Publisher	Springer Netherlands Springer Nature B.V
Publisher_xml	– name: Springer Netherlands – name: Springer Nature B.V
References	Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, chap. 10, pp. 399–446. PWS Publishing Company (1996) Roos, M., Rothe, J.: Complexity of social welfare optimization in multiagent resource allocation. In: Proceedings of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 641–648. IFAAMAS (2010) Nguyen, N., Nguyen, T., Roos, M., Rothe, J.: Complexity and approximability of social welfare optimization in multiagent resource allocation (extended abstract). In: Proceedings of the 11th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1287–1288. IFAAMAS (2012) NguyenNNguyenTRoosMRotheJComplexity and approximability of egalitarian and Nash product social welfare optimization in multiagent resource allocationProceedings of the 6th European Starting AI Researcher Symposium2012Amsterdam, The NetherlandsIOS Press204215 ChakrabartyDChuzhoyJKhannaSOn allocating goods to maximize fairnessProceedings of the 50th IEEE Symposium on Foundations of Computer Science2009Los AlamitosIEEE Computer Society Press107116 KuhnHThe Hungarian method for the assignment problemNav. Res. Logist. Q.195521–2839710.1002/nav.3800020109 RamezaniSEndrissUNash social welfare in multiagent resource allocationAgent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. Lecture Notes in Business Information Processing, vol. 792010Berlin Heidelberg New YorkSpringer11713110.1007/978-3-642-15117-0_9 ChekuriCVondrákJZenklusenRDependent randomized rounding via exchange properties of combinatorial structuresProceedings of the 51st IEEE Symposium on Foundations of Computer Science2010Los AlamitosIEEE Computer Society Press575584 Rothe, J., Baumeister, D., Lindner, C., Rothe, I.: Einführung in Computational Social Choice: Individuelle Strategien und Kollektive Entscheidungen Beim Spielen, Wählen und Teilen. Spektrum Akademischer Verlag (2011) HorowitzESahniSExact and approximate algorithms for scheduling nonidentical processorsJ. ACM197623231732710.1145/321941.3219510329.68041395801 CsirikJKellererHWoegingerGThe exact LPT-bound for maximizing the minimum completion timeOper. Res. Lett.199211528128710.1016/0167-6377(92)90004-M0767.900341183679 VaziraniVApproximation Algorithms20032New YorkSpringer10.1007/978-3-662-04565-7 DunnePWooldridgeMLaurenceMThe complexity of contract negotiationArtif. Intell.20051641–2234610.1016/j.artint.2005.01.0061132.685392139192 FeigeUOn allocations that maximize fairnessProceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms2008PhiladelphiaSociety for Industrial and Applied Mathematics287293 Golovin, D.: Max-min Fair Allocation of Indivisible Goods. Tech. Rep. CMU-CS-05-144, School of Computer Science, Carnegie Mellon University (2005) FeigeUOn maximizing welfare when utility functions are subadditiveSIAM J. Comput.200939112214210.1137/0706809771185.688552506521 LovászLBachemAGrötschelMKorteBSubmodular functions and convexityMathematical Programming—The State of the Art1983New YorkSpringer23525710.1007/978-3-642-68874-4_10 NisanNBidding and allocation in combinatorial auctionsProceedings of the 2nd ACM Conference on Electronic Commerce2000New YorkACM Press112 LiptonRMarkakisEMosselESaberiAOn approximately fair allocations of indivisible goodsProceedings of the 5th ACM Conference on Electronic Commerce2004New YorkACM Press125131 VondrákJOptimal approximation for the submodular welfare problem in the value oracle modelProceedings of the 40th ACM Symposium on Theory of Computing2008New YorkACM Press6774 FleischerLGoemansMMirrokniVSviridenkoMTight approximation algorithms for maximum general assignment problemsProceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms2006New YorkACM Press61162010.1145/1109557.1109624 FeigeUVondrákJApproximation algorithms for allocation problems: improving the factor of 1 − 1/eProceedings of the 47th IEEE Symposium on Foundations of Computer Science2006Los AlamitosIEEE Computer Society Press LenstraJShmoysDTardosEApproximation algorithms for scheduling unrelated parallel machinesMath. Program.199046125927110.1007/BF015857450715.900631054138 ChakrabartyDGoelGOn the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAPProceedings of the 49th IEEE Symposium on Foundations of Computer Science2008Los AlamitosIEEE Computer Society Press687696 LehmannDO’CallaghanLShohamYTruth revelation in approximately efficient combinatorial auctionsProceedings of the 1st ACM Conference on Electronic Commerce1999New YorkACM Press9610210.1145/336992.337016 GillJComputational complexity of probabilistic Turing machinesSIAM J. Comput.19776467569510.1137/02060490366.02024464691 BezákováIDaniVAllocating indivisible goodsSIGecom Exchanges200553111810.1145/1120680.1120683 KhotSPonnuswamiAApproximation algorithms for the max-min allocation problemProceedings of Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 10th International Workshop APPROX 2007 and 11th International Workshop RANDOM 2007. Lecture Notes in Computer Science, vol. 46272007Berlin Heidelberg New YorkSpringer204217 Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation with k-additive utility functions. In: Proceedings of the DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, Annales du LAMSADE, vol. 3, pp. 83–100 (2004) Holzman, R., Kfir-Dahav, N., Monderer, D., Tennenholtz, M.: Bundling Equilibrium in Combinatorial Auctions. Tech. Rep. cs.GT/0201010, ACM Computing Research Repository (CoRR) (2002) BlumrosenLNisanNNisanNRoughgardenTCombinatorial auctionsAlgorithmic Game Theory, chap. 112007CambridgeCambridge University Press26729910.1017/CBO9780511800481.013 GareyMJohnsonDComputers and Intractability: a Guide to the Theory of NP-Completeness1979San FranciscoFreeman0411.68039 GrabischMk-order additive discrete fuzzy measures and their representationFuzzy Sets Syst.199792216718910.1016/S0165-0114(97)00168-10927.280141486417 AsadpourASaberiAAn approximation algorithm for max-min fair allocation of indivisible goodsProceedings of the 39th ACM Symposium on Theory of Computing2007New YorkACM Press114121 RotheJComplexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science2005New YorkSpringer DobzinskiSNisanNSchapiraMApproximation algorithms for combinatorial auctions with complement-free biddersMath. Oper. Res.201035111310.1287/moor.1090.04361216.683382676753 DeuermeyerBFriesenDLangstonMScheduling to maximize the minimum processor finish time in a multiprocessor systemSIAM J. Algebr. Discrete Methods198232452454655560 PapadimitriouCComputational Complexity19952ReadingAddison-Wesley BansalNSviridenkoMThe Santa Claus problemProceedings of the 38th ACM Symposium on Theory of Computing2006New YorkACM Press3140 KhotSKindlerGMosselEO’DonnellROptimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM JComput.20073713193571135.680192306295 ChevaleyreYDunnePEndrissULangJLemaîtreMMaudetNPadgetJPhelpsSRodríguez-AguilarJSousaPIssues in multiagent resource allocationInformatica2006303311152.91455 RotaGOn the foundations of combinatorial theory I. Theory of Möbius functionsProbab. Theory Relat. Fields1964243403680121.02406174487 ChevaleyreYEndrissUEstivieSMaudetNMultiagent resource allocation in k-additive domains: preference representation and complexityAnn. Oper. Res.2008163496210.1007/s10479-008-0335-01170.914182430259 LehmannBLehmannDNisanNCombinatorial auctions with decreasing marginal utilitiesProceedings of the 3rd ACM Conference on Electronic Commerce2001New YorkACM Press1828 KhotSLiptonRMarkakisEMehtaAInapproximability results for combinatorial auctions with submodular utility functionsAlgorithmica200852131810.1007/s00453-007-9105-71142.914852429989 MoulinHFair Division and Collective Welfare2004CambridgeMIT Press AsadpourASaberiAAn approximation algorithm for max-min fair allocation of indivisible goodsSIAM J. Comput.20103972970298910.1137/0807234911217.490282645895 GoemansMHarveyNIwataSMirrokniVApproximating submodular functions everywhereProceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms2009PhiladelphiaSociety for Industrial and Applied Mathematics535544 HåstadJClique is hard to approximate within n1 − ϵActa Math.1999182110514210.1007/BF023928250989.680601687331 DobzinskiSSchapiraMAn improved approximation algorithm for combinatorial auctions with submodular biddersProceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms2006New YorkACM Press1064107310.1145/1109557.1109675 HåstadJSome optimal inapproximability resultsJ. ACM200148479885910.1145/502090.5020981127.684052144931 NguyenNNguyenTRoosMRotheJBrandtFFaliszewskiPComplexity and approximability of social welfare optimization in multiagent resource allocationProceedings of the 4th International Workshop on Computational Social Choice2012Kraków, PolandAGH University of Science and Technology335346 HochbaumDShmoysDUsing dual approximation algorithms for scheduling problems: theoretical and practical resultsJ. ACM198734114416210.1145/7531.7535882666 WoegingerGA polynomial-time approximation scheme for maximizing the minimum machine completion timeOper. Res. Lett.199720414915410.1016/S0167-6377(96)00055-70879.901211452078 Nguyen, T., Roos, M., Rothe, J.: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. In: Website Proceedings of the Special Session on Computational Social Choice at the 12th International Symposium on Artificial Intelligence and Mathematics (2012) BlumrosenLNisanNOn the computational power of iterative auctionsProceedings of the 6th ACM Conference on Electronic Commerce2005New YorkACM Press2943 CalinescuGChekuriCPálMVondrákJMaximizing a submodular set function subject to a matroid constraint (extended abstract)Proceedings of the 12th International Integer Programming an D Chakrabarty (9328_CR9) 2009 V Vazirani (9328_CR56) 2003 S Khot (9328_CR37) 2007 L Lovász (9328_CR43) 1983 9328_CR27 G Calinescu (9328_CR8) 2007 C Papadimitriou (9328_CR50) 1995 H Kellerer (9328_CR34) 2004 D Hochbaum (9328_CR31) 1987; 34 P Dunne (9328_CR19) 2005; 164 H Kuhn (9328_CR38) 1955; 2 N Nguyen (9328_CR46) 2012 J Rothe (9328_CR54) 2005 L Blumrosen (9328_CR6) 2005 B Lehmann (9328_CR39) 2001 9328_CR13 S Khot (9328_CR36) 2008; 52 S Ramezani (9328_CR51) 2010 C Chekuri (9328_CR11) 2010 9328_CR52 9328_CR55 U Feige (9328_CR21) 2009; 39 J Håstad (9328_CR30) 2001; 48 R Lipton (9328_CR42) 2004 M Grabisch (9328_CR28) 1997; 92 D Chakrabarty (9328_CR10) 2008 A Asadpour (9328_CR3) 2010; 39 S Dobzinski (9328_CR17) 2010; 35 N Nisan (9328_CR49) 2000 I Bezáková (9328_CR5) 2005; 5 J Håstad (9328_CR29) 1999; 182 J Vondrák (9328_CR57) 2008 U Feige (9328_CR20) 2008 Y Chevaleyre (9328_CR14) 2008; 163 U Feige (9328_CR22) 2006 N Nguyen (9328_CR45) 2012 J Lenstra (9328_CR41) 1990; 46 9328_CR48 L Blumrosen (9328_CR7) 2007 9328_CR47 D Lehmann (9328_CR40) 1999 J Gill (9328_CR25) 1977; 6 J Csirik (9328_CR15) 1992; 11 9328_CR1 M Garey (9328_CR24) 1979 G Woeginger (9328_CR58) 1997; 20 S Khot (9328_CR35) 2007; 37 E Horowitz (9328_CR33) 1976; 23 S Dobzinski (9328_CR18) 2006 A Asadpour (9328_CR2) 2007 Y Chevaleyre (9328_CR12) 2006; 30 M Goemans (9328_CR26) 2009 G Rota (9328_CR53) 1964; 2 H Moulin (9328_CR44) 2004 L Fleischer (9328_CR23) 2006 N Bansal (9328_CR4) 2006 B Deuermeyer (9328_CR16) 1982; 3 9328_CR32
References_xml	– reference: Nguyen, N., Nguyen, T., Roos, M., Rothe, J.: Complexity and approximability of social welfare optimization in multiagent resource allocation (extended abstract). In: Proceedings of the 11th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1287–1288. IFAAMAS (2012) – reference: CalinescuGChekuriCPálMVondrákJMaximizing a submodular set function subject to a matroid constraint (extended abstract)Proceedings of the 12th International Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science, vol. 45132007Berlin Heidelberg New YorkSpringer182196 – reference: Holzman, R., Kfir-Dahav, N., Monderer, D., Tennenholtz, M.: Bundling Equilibrium in Combinatorial Auctions. Tech. Rep. cs.GT/0201010, ACM Computing Research Repository (CoRR) (2002) – reference: Golovin, D.: Max-min Fair Allocation of Indivisible Goods. Tech. Rep. CMU-CS-05-144, School of Computer Science, Carnegie Mellon University (2005) – reference: DobzinskiSNisanNSchapiraMApproximation algorithms for combinatorial auctions with complement-free biddersMath. Oper. Res.201035111310.1287/moor.1090.04361216.683382676753 – reference: RamezaniSEndrissUNash social welfare in multiagent resource allocationAgent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. Lecture Notes in Business Information Processing, vol. 792010Berlin Heidelberg New YorkSpringer11713110.1007/978-3-642-15117-0_9 – reference: BansalNSviridenkoMThe Santa Claus problemProceedings of the 38th ACM Symposium on Theory of Computing2006New YorkACM Press3140 – reference: NguyenNNguyenTRoosMRotheJComplexity and approximability of egalitarian and Nash product social welfare optimization in multiagent resource allocationProceedings of the 6th European Starting AI Researcher Symposium2012Amsterdam, The NetherlandsIOS Press204215 – reference: ChakrabartyDGoelGOn the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAPProceedings of the 49th IEEE Symposium on Foundations of Computer Science2008Los AlamitosIEEE Computer Society Press687696 – reference: Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, chap. 10, pp. 399–446. PWS Publishing Company (1996) – reference: AsadpourASaberiAAn approximation algorithm for max-min fair allocation of indivisible goodsProceedings of the 39th ACM Symposium on Theory of Computing2007New YorkACM Press114121 – reference: NguyenNNguyenTRoosMRotheJBrandtFFaliszewskiPComplexity and approximability of social welfare optimization in multiagent resource allocationProceedings of the 4th International Workshop on Computational Social Choice2012Kraków, PolandAGH University of Science and Technology335346 – reference: NisanNBidding and allocation in combinatorial auctionsProceedings of the 2nd ACM Conference on Electronic Commerce2000New YorkACM Press112 – reference: LehmannDO’CallaghanLShohamYTruth revelation in approximately efficient combinatorial auctionsProceedings of the 1st ACM Conference on Electronic Commerce1999New YorkACM Press9610210.1145/336992.337016 – reference: HåstadJClique is hard to approximate within n1 − ϵActa Math.1999182110514210.1007/BF023928250989.680601687331 – reference: HorowitzESahniSExact and approximate algorithms for scheduling nonidentical processorsJ. ACM197623231732710.1145/321941.3219510329.68041395801 – reference: FeigeUVondrákJApproximation algorithms for allocation problems: improving the factor of 1 − 1/eProceedings of the 47th IEEE Symposium on Foundations of Computer Science2006Los AlamitosIEEE Computer Society Press – reference: KhotSPonnuswamiAApproximation algorithms for the max-min allocation problemProceedings of Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 10th International Workshop APPROX 2007 and 11th International Workshop RANDOM 2007. Lecture Notes in Computer Science, vol. 46272007Berlin Heidelberg New YorkSpringer204217 – reference: LovászLBachemAGrötschelMKorteBSubmodular functions and convexityMathematical Programming—The State of the Art1983New YorkSpringer23525710.1007/978-3-642-68874-4_10 – reference: GillJComputational complexity of probabilistic Turing machinesSIAM J. Comput.19776467569510.1137/02060490366.02024464691 – reference: AsadpourASaberiAAn approximation algorithm for max-min fair allocation of indivisible goodsSIAM J. Comput.20103972970298910.1137/0807234911217.490282645895 – reference: ChevaleyreYDunnePEndrissULangJLemaîtreMMaudetNPadgetJPhelpsSRodríguez-AguilarJSousaPIssues in multiagent resource allocationInformatica2006303311152.91455 – reference: DobzinskiSSchapiraMAn improved approximation algorithm for combinatorial auctions with submodular biddersProceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms2006New YorkACM Press1064107310.1145/1109557.1109675 – reference: ChekuriCVondrákJZenklusenRDependent randomized rounding via exchange properties of combinatorial structuresProceedings of the 51st IEEE Symposium on Foundations of Computer Science2010Los AlamitosIEEE Computer Society Press575584 – reference: Rothe, J., Baumeister, D., Lindner, C., Rothe, I.: Einführung in Computational Social Choice: Individuelle Strategien und Kollektive Entscheidungen Beim Spielen, Wählen und Teilen. Spektrum Akademischer Verlag (2011) – reference: LehmannBLehmannDNisanNCombinatorial auctions with decreasing marginal utilitiesProceedings of the 3rd ACM Conference on Electronic Commerce2001New YorkACM Press1828 – reference: RotheJComplexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science2005New YorkSpringer – reference: KhotSKindlerGMosselEO’DonnellROptimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM JComput.20073713193571135.680192306295 – reference: BlumrosenLNisanNOn the computational power of iterative auctionsProceedings of the 6th ACM Conference on Electronic Commerce2005New YorkACM Press2943 – reference: WoegingerGA polynomial-time approximation scheme for maximizing the minimum machine completion timeOper. Res. Lett.199720414915410.1016/S0167-6377(96)00055-70879.901211452078 – reference: BezákováIDaniVAllocating indivisible goodsSIGecom Exchanges200553111810.1145/1120680.1120683 – reference: BlumrosenLNisanNNisanNRoughgardenTCombinatorial auctionsAlgorithmic Game Theory, chap. 112007CambridgeCambridge University Press26729910.1017/CBO9780511800481.013 – reference: HåstadJSome optimal inapproximability resultsJ. ACM200148479885910.1145/502090.5020981127.684052144931 – reference: PapadimitriouCComputational Complexity19952ReadingAddison-Wesley – reference: GareyMJohnsonDComputers and Intractability: a Guide to the Theory of NP-Completeness1979San FranciscoFreeman0411.68039 – reference: MoulinHFair Division and Collective Welfare2004CambridgeMIT Press – reference: RotaGOn the foundations of combinatorial theory I. Theory of Möbius functionsProbab. Theory Relat. Fields1964243403680121.02406174487 – reference: Roos, M., Rothe, J.: Complexity of social welfare optimization in multiagent resource allocation. In: Proceedings of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 641–648. IFAAMAS (2010) – reference: GoemansMHarveyNIwataSMirrokniVApproximating submodular functions everywhereProceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms2009PhiladelphiaSociety for Industrial and Applied Mathematics535544 – reference: Nguyen, T., Roos, M., Rothe, J.: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. In: Website Proceedings of the Special Session on Computational Social Choice at the 12th International Symposium on Artificial Intelligence and Mathematics (2012) – reference: FleischerLGoemansMMirrokniVSviridenkoMTight approximation algorithms for maximum general assignment problemsProceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms2006New YorkACM Press61162010.1145/1109557.1109624 – reference: KuhnHThe Hungarian method for the assignment problemNav. Res. Logist. Q.195521–2839710.1002/nav.3800020109 – reference: FeigeUOn maximizing welfare when utility functions are subadditiveSIAM J. Comput.200939112214210.1137/0706809771185.688552506521 – reference: KellererHPferschyUPisingerDKnapsack Problems2004New YorkSpringer10.1007/978-3-540-24777-71103.90003 – reference: DunnePWooldridgeMLaurenceMThe complexity of contract negotiationArtif. Intell.20051641–2234610.1016/j.artint.2005.01.0061132.685392139192 – reference: VaziraniVApproximation Algorithms20032New YorkSpringer10.1007/978-3-662-04565-7 – reference: ChakrabartyDChuzhoyJKhannaSOn allocating goods to maximize fairnessProceedings of the 50th IEEE Symposium on Foundations of Computer Science2009Los AlamitosIEEE Computer Society Press107116 – reference: KhotSLiptonRMarkakisEMehtaAInapproximability results for combinatorial auctions with submodular utility functionsAlgorithmica200852131810.1007/s00453-007-9105-71142.914852429989 – reference: CsirikJKellererHWoegingerGThe exact LPT-bound for maximizing the minimum completion timeOper. Res. Lett.199211528128710.1016/0167-6377(92)90004-M0767.900341183679 – reference: FeigeUOn allocations that maximize fairnessProceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms2008PhiladelphiaSociety for Industrial and Applied Mathematics287293 – reference: LenstraJShmoysDTardosEApproximation algorithms for scheduling unrelated parallel machinesMath. Program.199046125927110.1007/BF015857450715.900631054138 – reference: HochbaumDShmoysDUsing dual approximation algorithms for scheduling problems: theoretical and practical resultsJ. ACM198734114416210.1145/7531.7535882666 – reference: ChevaleyreYEndrissUEstivieSMaudetNMultiagent resource allocation in k-additive domains: preference representation and complexityAnn. Oper. Res.2008163496210.1007/s10479-008-0335-01170.914182430259 – reference: LiptonRMarkakisEMosselESaberiAOn approximately fair allocations of indivisible goodsProceedings of the 5th ACM Conference on Electronic Commerce2004New YorkACM Press125131 – reference: VondrákJOptimal approximation for the submodular welfare problem in the value oracle modelProceedings of the 40th ACM Symposium on Theory of Computing2008New YorkACM Press6774 – reference: GrabischMk-order additive discrete fuzzy measures and their representationFuzzy Sets Syst.199792216718910.1016/S0165-0114(97)00168-10927.280141486417 – reference: DeuermeyerBFriesenDLangstonMScheduling to maximize the minimum processor finish time in a multiprocessor systemSIAM J. Algebr. Discrete Methods198232452454655560 – reference: Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation with k-additive utility functions. In: Proceedings of the DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, Annales du LAMSADE, vol. 3, pp. 83–100 (2004) – start-page: 611 volume-title: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms year: 2006 ident: 9328_CR23 doi: 10.1145/1109557.1109624 – volume: 163 start-page: 49 year: 2008 ident: 9328_CR14 publication-title: Ann. Oper. Res. doi: 10.1007/s10479-008-0335-0 – volume: 23 start-page: 317 issue: 2 year: 1976 ident: 9328_CR33 publication-title: J. ACM doi: 10.1145/321941.321951 – volume-title: Knapsack Problems year: 2004 ident: 9328_CR34 doi: 10.1007/978-3-540-24777-7 – volume-title: Fair Division and Collective Welfare year: 2004 ident: 9328_CR44 – start-page: 125 volume-title: Proceedings of the 5th ACM Conference on Electronic Commerce year: 2004 ident: 9328_CR42 doi: 10.1145/988772.988792 – ident: 9328_CR47 – volume: 182 start-page: 105 issue: 1 year: 1999 ident: 9328_CR29 publication-title: Acta Math. doi: 10.1007/BF02392825 – volume-title: Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science year: 2005 ident: 9328_CR54 – volume-title: Computational Complexity year: 1995 ident: 9328_CR50 – volume: 6 start-page: 675 issue: 4 year: 1977 ident: 9328_CR25 publication-title: SIAM J. Comput. doi: 10.1137/0206049 – start-page: 235 volume-title: Mathematical Programming—The State of the Art year: 1983 ident: 9328_CR43 doi: 10.1007/978-3-642-68874-4_10 – start-page: 204 volume-title: Proceedings of Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 10th International Workshop APPROX 2007 and 11th International Workshop RANDOM 2007. Lecture Notes in Computer Science, vol. 4627 year: 2007 ident: 9328_CR37 – start-page: 1 volume-title: Proceedings of the 2nd ACM Conference on Electronic Commerce year: 2000 ident: 9328_CR49 doi: 10.1145/352871.352872 – start-page: 335 volume-title: Proceedings of the 4th International Workshop on Computational Social Choice year: 2012 ident: 9328_CR46 – volume-title: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science year: 2006 ident: 9328_CR22 – volume-title: Computers and Intractability: a Guide to the Theory of NP-Completeness year: 1979 ident: 9328_CR24 – volume: 2 start-page: 340 issue: 4 year: 1964 ident: 9328_CR53 publication-title: Probab. Theory Relat. Fields – start-page: 267 volume-title: Algorithmic Game Theory, chap. 11 year: 2007 ident: 9328_CR7 doi: 10.1017/CBO9780511800481.013 – start-page: 18 volume-title: Proceedings of the 3rd ACM Conference on Electronic Commerce year: 2001 ident: 9328_CR39 doi: 10.1145/501158.501161 – ident: 9328_CR27 – volume: 20 start-page: 149 issue: 4 year: 1997 ident: 9328_CR58 publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(96)00055-7 – ident: 9328_CR48 – start-page: 29 volume-title: Proceedings of the 6th ACM Conference on Electronic Commerce year: 2005 ident: 9328_CR6 doi: 10.1145/1064009.1064013 – start-page: 96 volume-title: Proceedings of the 1st ACM Conference on Electronic Commerce year: 1999 ident: 9328_CR40 doi: 10.1145/336992.337016 – volume: 11 start-page: 281 issue: 5 year: 1992 ident: 9328_CR15 publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(92)90004-M – volume: 48 start-page: 798 issue: 4 year: 2001 ident: 9328_CR30 publication-title: J. ACM doi: 10.1145/502090.502098 – volume: 92 start-page: 167 issue: 2 year: 1997 ident: 9328_CR28 publication-title: Fuzzy Sets Syst. doi: 10.1016/S0165-0114(97)00168-1 – volume: 3 start-page: 452 issue: 2 year: 1982 ident: 9328_CR16 publication-title: SIAM J. Algebr. Discrete Methods doi: 10.1137/0603019 – start-page: 535 volume-title: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms year: 2009 ident: 9328_CR26 doi: 10.1137/1.9781611973068.59 – start-page: 107 volume-title: Proceedings of the 50th IEEE Symposium on Foundations of Computer Science year: 2009 ident: 9328_CR9 – start-page: 287 volume-title: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms year: 2008 ident: 9328_CR20 – volume: 39 start-page: 122 issue: 1 year: 2009 ident: 9328_CR21 publication-title: SIAM J. Comput. doi: 10.1137/070680977 – volume: 5 start-page: 11 issue: 3 year: 2005 ident: 9328_CR5 publication-title: SIGecom Exchanges doi: 10.1145/1120680.1120683 – start-page: 575 volume-title: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science year: 2010 ident: 9328_CR11 – start-page: 67 volume-title: Proceedings of the 40th ACM Symposium on Theory of Computing year: 2008 ident: 9328_CR57 – volume-title: Approximation Algorithms year: 2003 ident: 9328_CR56 doi: 10.1007/978-3-662-04565-7 – ident: 9328_CR55 – start-page: 117 volume-title: Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. Lecture Notes in Business Information Processing, vol. 79 year: 2010 ident: 9328_CR51 doi: 10.1007/978-3-642-15117-0_9 – ident: 9328_CR1 – start-page: 182 volume-title: Proceedings of the 12th International Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science, vol. 4513 year: 2007 ident: 9328_CR8 – ident: 9328_CR13 – ident: 9328_CR32 – volume: 52 start-page: 3 issue: 1 year: 2008 ident: 9328_CR36 publication-title: Algorithmica doi: 10.1007/s00453-007-9105-7 – volume: 34 start-page: 144 issue: 1 year: 1987 ident: 9328_CR31 publication-title: J. ACM doi: 10.1145/7531.7535 – start-page: 114 volume-title: Proceedings of the 39th ACM Symposium on Theory of Computing year: 2007 ident: 9328_CR2 – volume: 30 start-page: 3 year: 2006 ident: 9328_CR12 publication-title: Informatica – volume: 2 start-page: 83 issue: 1–2 year: 1955 ident: 9328_CR38 publication-title: Nav. Res. Logist. Q. doi: 10.1002/nav.3800020109 – start-page: 687 volume-title: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science year: 2008 ident: 9328_CR10 – volume: 164 start-page: 23 issue: 1–2 year: 2005 ident: 9328_CR19 publication-title: Artif. Intell. doi: 10.1016/j.artint.2005.01.006 – volume: 46 start-page: 259 issue: 1 year: 1990 ident: 9328_CR41 publication-title: Math. Program. doi: 10.1007/BF01585745 – start-page: 1064 volume-title: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms year: 2006 ident: 9328_CR18 doi: 10.1145/1109557.1109675 – volume: 39 start-page: 2970 issue: 7 year: 2010 ident: 9328_CR3 publication-title: SIAM J. Comput. doi: 10.1137/080723491 – start-page: 204 volume-title: Proceedings of the 6th European Starting AI Researcher Symposium year: 2012 ident: 9328_CR45 – ident: 9328_CR52 – start-page: 31 volume-title: Proceedings of the 38th ACM Symposium on Theory of Computing year: 2006 ident: 9328_CR4 – volume: 35 start-page: 1 issue: 1 year: 2010 ident: 9328_CR17 publication-title: Math. Oper. Res. doi: 10.1287/moor.1090.0436 – volume: 37 start-page: 319 issue: 1 year: 2007 ident: 9328_CR35 publication-title: Comput.
SSID	ssj0009686
Score	2.1459246
Snippet	Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable....
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	65
SubjectTerms	Agents (artificial intelligence) Artificial Intelligence Bundles Complex Systems Computer Science Focusing Mathematical models Mathematics Multiagent systems Optimization Reagents Resource allocation Utilities
SummonAdditionalLinks	– databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1La9wwEB6abQ7JoWnSlm6aFBVyShBdSbbkPZWlNBRKQw8N5Ga0esDCxk7Wu3mQPx-NLK9poLnkaluSYWY0o5nR9wEcZVZqlhtOtUcKMydsMCnJKMs1s2zkM-dtJJtQZ2fFxcX4T0q4NamtstsT40Zta4M58q98zIpIWZp_u7qmyBqF1dVEobEBrxnnDPX8l6I96K6MTI8IYUWDGxNdVbO9OpcpbErgNEQwBc3-9Ut9sPmkPhrdzunOS3_4LbxJASeZtBqyC69ctQc7HZkDSba9B9u_1wCuzTt4mJBmtbhx96T2JOKO380uW0jve6IrS2bV06fh3L6aLxsSomDSZuLJrZt7vXCkDvvSZbrwGUaS2MWo8VIXjorlA4INAG368D2cn_74-_0nTTwN1AT3v6SmsFJ4Jf3IepXbIi8cZqeMkjY3UzxB-rEWI8uFnnJr0EVyVyinER6AGSE-wKCqK_cRiMp9CGG9xDglc3aqxRhTfzqTMiwi2RBGnZRKk0DMkUtjXvbwyyjYMgi2RMGW2RCO10OuWgSP5z4-6IRZJmNuyl6SQ_iyfh3MEGsrunL1qikRqFGEo5kqhnDSqUw_xX8X3H9-wU-wxSP_BvYHH8BguVi5Q9g0N8tZs_gctf0RgocG0w priority: 102 providerName: ProQuest
Title	A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
URI	https://link.springer.com/article/10.1007/s10472-012-9328-4 https://www.proquest.com/docview/2918195085 https://www.proquest.com/docview/1506374778
Volume	68
WOSCitedRecordID	wos000328831600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1573-7470 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: P5Z dateStart: 19970301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7470 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: K7- dateStart: 19970301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1573-7470 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: M7S dateStart: 19970301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7470 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: BENPR dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7470 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTxsxEB6VwKEcoKVFhEfkSj1RWcqud23nGBAICTWKeFSIy8rxQ4oUNiib8BB_Ho93NykIkNrLHnb9WNkez9gz830APxPDVZTqmCqHFGaWGS9SPKJRqiITtV1inQlkE6LXk1dXnX6Vx13U0e61SzLs1H8luyUCwwhi6m0OSZMlWPbaTqI0np3_WSDt8kDviLhV1OsuVrsy32ripTJaWJivnKJB1xyv_9dffoG1yrQk3XItfIVPNt-A9Zq2gVRSvAGrv-dQrcU3eOqSYja5s49k7EhAGH8Y3pTg3Y9E5YYM89dv_Ql9NpoWxNu7pLxzJ_d25NTEkrHfgW6q1E5fk4R4RYXpW1grOAoIuvrLi8LvcHl8dHF4QitGBqq9op9SLQ1nTnDXNk6kRqbS4j2UFtykeoBnRddRrG1ipgax0agMYyuFVQgEEGnGNqGRj3O7BUSkzhurjqNFklgzUKyDl3wq4dx3wqMmtOupyXQFV46sGaNsAbSMQ535oc5wqLOkCfvzKrclVsdHhXfr-c4qsS2yuBPJwIubNuHH_LMXOPSiqNyOZ0WGkIzMH8KEbMKveg0smni3w-1_Kr0Dn-NAvIGBwbvQmE5mdg9W9N10WExasHxw1OuftWDpVNAWxque-2c_vW4FWXgGxtMA1Q
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB1VBQk4UCggFgoYCS4gqxsnsb0HhCqgarXtikORejNef0grbZOS7Las-E_8RjxOshGV6K0HrkkcS8nzeDwf7wG8ySzXSW4Y1R4lzFxqw5LiCU1yndhk6DPnbRSbEJOJPD0dfd2A310vDJZVdjYxGmpbGoyR77JRIqNkaf7x_AdF1SjMrnYSGg0sxm51GY5s9YfDz-H_vmVs_8vJpwPaqgpQEzarBTXS8tQL7ofWi9zKXDqMpRjBbW6meN7xI50OLUv1lFmDBp05KZzGZvbEYAA0mPxbWSoFcvWPBe1JfnlUlkTKLBq2zbTLojatepnAIghGg8ckafb3Ptg7t1fysXGb29_63z7QA7jfOtRkr1kBD2HDFduw1YlVkNZ2bcO94zVBbf0Ifu2RellduBUpPYm86j9nZw1l-YrowpJZcfVq5erlfFGT4OWTJtNALt3c68qRMtjds7ahNYwksUpTY9MajorpEYIFDk149DF8u5EP8gQ2i7JwT4GI3AcX3XP0wzJnpzodYWhTZ5yHSXgygGGHCmVaknbUCpmrnl4agaQCkBQCSWUDeLcect4wlFz38E4HHtUaq1r1yBnA6_XtYGYwd6QLVy5rhUSUaTh6CjmA9x1E-1f8c8Jn10_4Cu4cnBwfqaPDyfg53GVRawRroXdgc1Et3Qu4bS4Ws7p6GVcage83jdw_5kdi8w
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS-tAFD64cdEHd7GuI9wnJbTJJJP0UdSiqEVQL74N01mgUFNpUhf8886ZJK2KChdfk1nCzJycdb4P4G-omPAjGXjCIIWZpsqKFPM9PxK-8hsm1EY5som43U7u7ppXJc9pVlW7VynJ4k4DojSlef1Bmfq7i29hjCUFgWftj8QLJ2E6RM4gdNev_41Rd5mjekQMK8_qMVqlNb8a4qNiGlubnxKkTu-0Fn79xYswX5qc5LA4I0swodNlWKjoHEgp3cswdzmCcM1W4PWQZMPBo34hfUMc8vhz974A9X4hIlWkm35-aj33YS_PiLWDSRGLJ0-6Z8RAk779M92XVz5tT-LqGAVe68JeLoFAsASgCCCuwm3r5Obo1CuZGjxpDYDck4li1MTMNJSJI5VEicb4lIyZimQHfUjTFLShAio6gZKoJAOdxFogQIAvKV2DqbSf6nUgcWSsEWsYWiqhVh1Bmxj8EyFjdhLm16BRbROXJYw5smn0-BiAGZea26XmuNQ8rMH-qMtDgeHxU-Otau95Kc4ZD5p-4vhyoxrsjV5bQcTsikh1f5hxhGqk1jmLkxocVOdhPMS3E278V-td-HN13OIXZ-3zTZgNHDcH1g5vwVQ-GOptmJGPeTcb7DhBeAM2Wwg7
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+survey+of+approximability+and+inapproximability+results+for+social+welfare+optimization+in+multiagent+resource+allocation&rft.jtitle=Annals+of+mathematics+and+artificial+intelligence&rft.au=Nguyen%2C+Trung+Thanh&rft.au=Roos%2C+Magnus&rft.au=Rothe%2C+J%C3%B6rg&rft.date=2013-07-01&rft.pub=Springer+Netherlands&rft.issn=1012-2443&rft.eissn=1573-7470&rft.volume=68&rft.issue=1-3&rft.spage=65&rft.epage=90&rft_id=info:doi/10.1007%2Fs10472-012-9328-4&rft.externalDocID=10_1007_s10472_012_9328_4
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1012-2443&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1012-2443&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1012-2443&client=summon