{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:01:03Z","timestamp":1743152463024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590154"},{"type":"electronic","value":"9783030590161"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59016-1_5","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T13:05:10Z","timestamp":1599743110000},"page":"51-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Can the Max-Min Fair Allocation Be Trustful in a Centralized Resource System?"],"prefix":"10.1007","author":[{"given":"Zheng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhaoquan","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Yuexuan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,10]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-16170-4_4","volume-title":"Algorithmic Game Theory","author":"B Adsul","year":"2010","unstructured":"Adsul, B., Babu, C.S., Garg, J., Mehta, R., Sohoni, M.: Nash equilibria in fisher market. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 30\u201341. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16170-4_4"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1080\/1540496X.2017.1423469","volume":"54","author":"C Aloui","year":"2018","unstructured":"Aloui, C., Hkiri, B., Hammoudeh, S., Shahbaz, M.: A multiple and partial wavelet analysis of the oil price, inflation, exchange rate, and economic growth nexus in Saudi Arabia. Emerg. Mark. Finance Trade 54(4), 935\u2013956 (2018)","journal-title":"Emerg. Mark. Finance Trade"},{"key":"5_CR3","volume-title":"Data Networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall Inc., Upper Saddle River (1992)","edition":"2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Blot, M., Cord, M., Thome, N.: Max-min convolutional neural networks for image classification. In: IEEE International Conference on Image Processing, pp. 3678\u20133682 (2016)","DOI":"10.1109\/ICIP.2016.7533046"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1022099910864","volume":"12","author":"SJ Brams","year":"1999","unstructured":"Brams, S.J., Taylor, A.D.: Fair division: from cake-cutting to dispute resolution. Soc. Justice Res. 12(2), 149\u2013162 (1999)","journal-title":"Soc. Justice Res."},{"key":"5_CR6","unstructured":"Charny, A.: An algorithm for rate allocation in a packet. Massachusetts Institute of Technology (1994)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, S., Li, B., Li, B.: Scheduling jobs across geo-distributed datacenters with max-min fairness. In: INFOCOM 2017 - IEEE Conference on Computer Communications, pp. 1\u20139. IEEE (2017)","DOI":"10.1109\/INFOCOM.2017.8056949"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-31585-5_42","volume-title":"Automata, Languages, and Programming","author":"N Chen","year":"2012","unstructured":"Chen, N., Deng, X., Zhang, H., Zhang, J.: Incentive ratios of fisher markets. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 464\u2013475. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_42"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-23719-5_10","volume-title":"Algorithms \u2013 ESA 2011","author":"N Chen","year":"2011","unstructured":"Chen, N., Deng, X., Zhang, J.: How profitable are strategic behaviors in a market? In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 106\u2013118. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_10"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games Econ. Behav. 77(1), 284\u2013297 (2013)","journal-title":"Games Econ. Behav."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Z., Cheng, Y., Deng, X., Qi, Q., Yan, X.: Agent incentives of strategic behavior in resource exchange. In: International Symposium on Algorithmic Game Theory, pp. 227\u2013239 (2017)","DOI":"10.1007\/978-3-319-66700-3_18"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-662-48433-3_15","volume-title":"Algorithmic Game Theory","author":"Y Cheng","year":"2015","unstructured":"Cheng, Y., Deng, X., Pi, Y., Yan, X.: Can bandwidth sharing be truthful? In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 190\u2013202. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48433-3_15"},{"key":"5_CR13","unstructured":"Cheng, Y., Deng, X., Qi, Q., Yan, X.: Truthfulness of a proportional sharing mechanism in resource exchange. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 187\u2013193 (2016)"},{"key":"5_CR14","unstructured":"Cretch, P., Michielsens, J., Taeymans, J.: Data network (2002)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, M., Lai, K., Stoica, I., Chuang, J.: Robust incentive techniques for peer-to-peer networks. In: ACM Conference on Electronic Commerce, pp. 102\u2013111 (2004)","DOI":"10.1145\/988772.988788"},{"key":"5_CR16","volume-title":"Puzzle-Math","author":"G Gamow","year":"1958","unstructured":"Gamow, G., Stern, M.: Puzzle-Math. The Viking Press, New York (1958)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Ghumman, N.S., Kaur, R.: Dynamic combination of improved max-min and ant colony algorithm for load balancing in cloud system. In: International Conference on Computing, Communication and NETWORKING Technologies, pp. 1\u20135 (2016)","DOI":"10.1109\/ICCCNT.2015.7395172"},{"issue":"7","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/49.103550","volume":"9","author":"EL Hahne","year":"1991","unstructured":"Hahne, E.L.: Round-robin scheduling for max-min fairness in data networks. IEEE J. Sel. Areas Commun. 9(7), 1024\u20131039 (1991)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"5_CR19","unstructured":"Hurwicz, L.: On Informationally Decentralized Systems (1972)"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/LCOMM.2016.2516002","volume":"20","author":"Y Jia","year":"2016","unstructured":"Jia, Y., Zhao, M., Zhou, W.: Joint user association and eICIC for max-min fairness in HetNets. IEEE Commun. Lett. 20(3), 546\u2013549 (2016)","journal-title":"IEEE Commun. Lett."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Khamse-Ashari, J., Kesidis, G., Lambadaris, I., Urgaonkar, B., Zhao, Y.: Constrained max-min fair scheduling of variable-length packet-flows to multiple servers. Ann. Telecommun. 73(3\u20134), 219\u2013237 (2018)","DOI":"10.1007\/s12243-017-0599-y"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Menon, V., Larson, K., Menon, V., Larson, K., Menon, V., Larson, K.: Deterministic, strategyproof, and fair cake cutting (2017)","DOI":"10.24963\/ijcai.2017\/50"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Pham, T.V., Pham, A.T.: Max-min fairness and sum-rate maximization of MU-VLC local networks. In: IEEE GLOBECOM Workshops, pp. 1\u20136 (2016)","DOI":"10.1109\/GLOCOMW.2015.7414133"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM (JACM) 49(2), 236\u2013259 (2002)","journal-title":"J. ACM (JACM)"},{"key":"5_CR25","unstructured":"Segal-Halevi, E.: Cutting a cake with both good and bad parts (2017)"},{"key":"5_CR26","unstructured":"Segal-Halevi, E., Nitzan, S.: Envy-free cake-cutting among families (2016)"},{"key":"5_CR27","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Wahlen, S., Laamanen, M.: Collaborative consumption and sharing economies (2017)","DOI":"10.4324\/9781315675015-10"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59016-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T23:00:50Z","timestamp":1619305250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59016-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590154","9783030590161"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59016-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"216","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}