{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:56:55Z","timestamp":1743112615805,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551949"},{"type":"electronic","value":"9783642551956"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55195-6_4","type":"book-chapter","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:55:32Z","timestamp":1399474532000},"page":"38-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fair Share Is Not Enough: Measuring Fairness in Scheduling with Cooperative Game Theory"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Skowron","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Rzadca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Carroll, T.E., Grosu, D.: Divisible load scheduling: an approach using coalitional games. In: Proceedings of the ISPDC (2007)","DOI":"10.1109\/ISPDC.2007.16"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TNET.2003.815290","volume":"11","author":"HM Chaskar","year":"2003","unstructured":"Chaskar, H.M., Madhow, U.: Fair scheduling with tunable latency: a round-robin approach. IEEE\/ACM Trans. Netw. 11(4), 592\u2013601 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"17","key":"4_CR3","doi-asserted-by":"publisher","first-page":"2220","DOI":"10.1002\/cpe.1752","volume":"23","author":"J Cohen","year":"2011","unstructured":"Cohen, J., Cordeiro, D., Trystram, D., Wagner, F.: Multi-organization scheduling approximation algorithms. Concurr. Comput. Pract. Exp. 23(17), 2220\u20132234 (2011)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1109\/TPDS.2011.47","volume":"22","author":"P-F Dutot","year":"2011","unstructured":"Dutot, P.-F., Pascual, F., Rzadca, K., Trystram, D.: Approximation algorithms for the multi-organization scheduling problem. IEEE Trans. Parallel Distrib. Syst. 22, 1888\u20131895 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"4_CR5","unstructured":"Feitelson, D.G.: Parallel workloads archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Goyal, P., Vin, H.M., Chen, H.: Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. In: Proceedings of the SIGCOMM, pp. 157\u2013168 (1996)","DOI":"10.1145\/248157.248171"},{"issue":"6","key":"4_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1453775.1453779","volume":"42","author":"A Gulati","year":"2008","unstructured":"Gulati, A., Ahmad, I.: Towards distributed storage resource management using flow control. SIGOPS Oper. Syst. Rev. 42(6), 10\u201316 (2008)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"4_CR8","unstructured":"Gulati, A., Ahmad, I., Waldspurger, C.A.: PARDA: proportional allocation of resources for distributed storage access. In: FAST Proceedings, February 2009"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1012888.1005694","volume":"32","author":"W Jin","year":"2004","unstructured":"Jin, W., Chase, J.S., Kaur, J.: Interposed proportional sharing for a storage service utility. SIGMETRICS Perform. Eval. Rev. 32(1), 37\u201348 (2004)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/35043.35047","volume":"31","author":"J Kay","year":"1988","unstructured":"Kay, J., Lauder, P.: A fair share scheduler. Commun. ACM 31(1), 44\u201355 (1988)","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ejor.2003.06.010","volume":"158","author":"MM Kostreva","year":"2004","unstructured":"Kostreva, M.M., Ogryczak, W., Wierzbicki, A.: Equitable aggregations and multiple criteria analysis. Eur. J. Oper. Res. 158(2), 362\u2013377 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Mashayekhy, L., Grosu, D.: A merge-and-split mechanism for dynamic virtual organization formation in grids. In: PCCC Proceedings, pp. 1\u20138 (2011)","DOI":"10.1109\/PCCC.2011.6108108"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Mishra, D., Rangarajan, B.: Cost sharing in a job scheduling problem using the Shapley value. In: Proceedings of the EC, pp. 232\u2013239 (2005)","DOI":"10.2139\/ssrn.912238"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/moor.1060.0239","volume":"32","author":"H Moulin","year":"2007","unstructured":"Moulin, H.: On scheduling fees to prevent merging, splitting, and transferring of jobs. Math. Oper. Res. 32(2), 266\u2013283 (2007)","journal-title":"Math. Oper. Res."},{"key":"4_CR15","volume-title":"A Course in Game Theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory, vol. 1. MIT Press, Cambridge (1994)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Rzadca, K., Trystram, D., Wierzbicki, A.: Fair game-theoretic resource management in dedicated grids. In: CCGRID Proceedings (2007)","DOI":"10.1109\/CCGRID.2007.52"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Skowron, P., Rzadca, K.: Non-monetary fair scheduling \u2013 cooperative game theory approach. In: SPAA (see also the extended arxiv version) (2013)","DOI":"10.1145\/2486159.2486169"},{"key":"4_CR18","unstructured":"Wang, Y., Merchant, A.: Proportional-share scheduling for distributed storage systems. In: FAST Proceedings, pp. 4\u20134 (2007)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55195-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T23:02:44Z","timestamp":1675810964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55195-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551949","9783642551956"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55195-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}