{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:09Z","timestamp":1725747189593},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024134"},{"type":"electronic","value":"9783319024141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02414-1_11","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T09:12:23Z","timestamp":1377853943000},"page":"149-160","source":"Crossref","is-referenced-by-count":10,"title":["Preference-Based Resource Allocation: Using Heuristics to Solve Two-Sided Matching Problems with Indifferences"],"prefix":"10.1007","author":[{"given":"Christian","family":"Haas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven O.","family":"Kimbrough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Caton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Weinhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Chard, K., Caton, S., Rana, O., Bubendorfer, K.: Social Cloud: Cloud Computing in Social Networks. In: 2010 IEEE 3rd International Conference on Cloud Computing (CLOUD), pp. 99\u2013106 (2010)","DOI":"10.1109\/CLOUD.2010.28"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Chard, K., Caton, S., Rana, O., Katz, D.S.: Social Cloud Computing: A Vision for Socially Motivated Resource Sharing. In: The Third International Workshop on Data Intensive Computing in the Clouds, DataCloud 2012 (2012)","DOI":"10.1109\/TSC.2011.39"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Fehr, E., Schmidt, K.M.: 8. In: The Economics of Fairness, Reciprocity and Altruism - Experimental Evidence and New Theories. Handbook on the Economics of Giving, Reciprocity and Altruism, vol.\u00a01, pp. 615\u2013691. Elsevier (2006)","DOI":"10.1016\/S1574-0714(06)01008-6"},{"issue":"10","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1016\/j.comnet.2008.10.020","volume":"53","author":"W. Streitberger","year":"2009","unstructured":"Streitberger, W., Eymann, T.: A simulation of an economic, self-organising resource allocation approach for application layer networks. Computer Networks\u00a053(10), 1760\u20131770 (2009)","journal-title":"Computer Networks"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00182-008-0117-6","volume":"36","author":"A. Roth","year":"2008","unstructured":"Roth, A.: Deferred acceptance algorithms: History, theory, practice, and open questions. International Journal of Game Theory\u00a036(3), 537\u2013569 (2008)","journal-title":"International Journal of Game Theory"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1273340.1273346","volume":"3","author":"M. Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. ACM Transactions on Algorithms (TALG)\u00a03(3), 30 (2007)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Kimbrough, S., Kuo, A.: On heuristics for two-sided matching: Revisiting the stable marriage problem as a multiobjective problem. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 1283\u20131290. ACM (2010)","DOI":"10.1145\/1830483.1830712"},{"key":"11_CR8","unstructured":"Nakamura, M., Onaga, K., Kyan, S., Silva, M.: Genetic algorithm for sex-fair stable marriage problem. In: 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, April- May 3, vol.\u00a01, pp. 509\u2013512 (1995)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. In: American Mathematical Monthly, pp. 9\u201315 (1962)","DOI":"10.1080\/00029890.1962.11989827"},{"key":"11_CR10","unstructured":"Erdil, A., Ergin, H.: Two-sided matching with indifferences. Unpublished mimeo, Harvard Business School (2006)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1257\/aer.98.3.669","volume":"98","author":"A. Erdil","year":"2008","unstructured":"Erdil, A., Ergin, H.: What\u2019s the matter with tie-breaking? improving efficiency in school choice. The American Economic Review\u00a098(3), 669\u2013689 (2008)","journal-title":"The American Economic Review"},{"key":"11_CR12","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"#cr-split#-11_CR13.1","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms. CRM Proceedings & Lecture Notes, Centre de Recherches Math\u00e9matiques Universit\u00e9 de Montr\u00e9al, vol. 10. American Mathematical Society, Providence, RI (1997)","DOI":"10.1090\/crmp\/010"},{"key":"#cr-split#-11_CR13.2","unstructured":"Originally published as Knuth, D.E.: Marriages Stables. Les Presses de l'Universit\u00e9 de Montreal, Montreal Canada (1976)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R.W. Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the optimal stable marriage. Journal of the ACM\u00a034(3), 532\u2013543 (1987)","journal-title":"Journal of the ACM"},{"key":"11_CR15","unstructured":"Axtell, R.L., Kimbrough, S.O.: The high cost of stability in two-sided matching: How much social welfare should be sacrificed in the pursuit of stability? In: Proceedings of the 2008 World Congress on Social Simulation, WCSS 2008 (2008)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00199-004-0602-5","volume":"27","author":"B. Klaus","year":"2006","unstructured":"Klaus, B., Klijn, F.: Procedurally fair and stable matching. Economic Theory\u00a027, 431\u2013447 (2006)","journal-title":"Economic Theory"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-73951-7_18","volume-title":"Algorithms and Data Structures","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: Approximation algorithms for the sex-equal stable marriage problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 201\u2013213. Springer, Heidelberg (2007)"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009686927235","volume":"5","author":"B. Aldershof","year":"1999","unstructured":"Aldershof, B., Carducci, O.M.: Stable marriage and genetic algorithms: A fertile union. Journal of Heuristics\u00a05(1), 29\u201346 (1999)","journal-title":"Journal of Heuristics"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Vien, N.A., Chung, T.C.: Multiobjective fitness functions for stable marriage problem using genetic algorithm. In: International Joint Conference on SICE-ICASE, pp. 5500\u20135503 (October 2006)","DOI":"10.1109\/SICE.2006.315686"},{"key":"11_CR20","unstructured":"Royal Swedish Academy of Sciences: The Sveriges Riksbank prize in economic sciences in memory of Alfred Nobel for 2012. Word Wide Web (October 2012), \n                    \n                      http:\/\/www.nobelprize.org\/nobel_prizes\/economic-sciences\/laureates\/2012\/advanced-economicsciences2012.pdf"},{"key":"11_CR21","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc. (1989)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput.\u00a016(1), 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Haas, C., Caton, S., Trumpp, D., Weinhardt, C.: A Simulator for Social Exchanges and Collaborations - Architecture and Case Study. In: Proceedings of the 8th IEEE International Conference on eScience, eScience 2012 (2012)","DOI":"10.1109\/eScience.2012.6404414"}],"container-title":["Lecture Notes in Computer Science","Economics of Grids, Clouds, Systems, and Services"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02414-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:35:26Z","timestamp":1558053326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02414-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024134","9783319024141"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02414-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}