{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:40:10Z","timestamp":1751193610339,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819683116","type":"print"},{"value":"9789819683123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-8312-3_18","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:04Z","timestamp":1751192104000},"page":"238-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pure Nash Equilibria of\u00a0Weighted Picking Sequence Protocol is WEF1 for\u00a0Two Agents"],"prefix":"10.1007","author":[{"given":"Rufan","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huahua","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengwei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","volume":"63","author":"N Alon","year":"1987","unstructured":"Alon, N.: Splitting necklaces. Adv. Math. 63(3), 247\u2013253 (1987)","journal-title":"Adv. Math."},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103965","volume":"322","author":"G Amanatidis","year":"2023","unstructured":"Amanatidis, G., et al.: Fair division of indivisible goods: recent progress and open questions. Artif. Intell. 322, 103965 (2023)","journal-title":"Artif. Intell."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Christodoulou, G., Markakis, E.: Truthful allocation mechanisms without payments: characterization and implications on fairness. In: EC, pp. 545\u2013562. ACM (2017)","DOI":"10.1145\/3033274.3085147"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"2425","DOI":"10.1287\/moor.2022.0058","volume":"49","author":"G Amanatidis","year":"2024","unstructured":"Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., Reiffenh\u00e4user, R.: Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness. Math. Oper. Res. 49(4), 2425\u20132445 (2024)","journal-title":"Math. Oper. Res."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Lazos, P., Leonardi, S., Reiffenh, R.: \u00e4user. Round-robin beyond additive agents: existence and fairness of approximate equilibria. In: EC, pp. 67\u201387. ACM (2023)","DOI":"10.1145\/3580507.3597796"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-67504-6_19","volume-title":"Algorithmic Decision Theory","author":"H Aziz","year":"2017","unstructured":"Aziz, H., Goldberg, P., Walsh, T.: Equilibria in sequential allocation. In: Rothe, J. (ed.) ADT 2017. LNCS (LNAI), vol. 10576, pp. 270\u2013283. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67504-6_19"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3572885.3572887","volume":"20","author":"H Aziz","year":"2022","unstructured":"Aziz, H., Li, B., Moulin, H., Wu, X.: Algorithmic fair allocation of indivisible items: a survey and new questions. SIGecom Exch. 20(1), 24\u201340 (2022)","journal-title":"SIGecom Exch."},{"key":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104118","volume":"331","author":"H Aziz","year":"2024","unstructured":"Aziz, H., Li, B., Moulin, H., Wu, X., Zhu, X.: Almost proportional allocations of indivisible chores: computation, approximation and efficiency. Artif. Intell. 331, 104118 (2024)","journal-title":"Artif. Intell."},{"key":"18_CR9","first-page":"5119","volume":"35","author":"M Babaioff","year":"2021","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. Proc. AAAI Conf. Artif. Intell. 35, 5119\u20135126 (2021)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Barman, S., Verma, P.: Truthful and fair mechanisms for matroid-rank valuations. In: AAAI, pp. 4801\u20134808. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20407"},{"issue":"6","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-04428-1_10","volume-title":"Algorithmic Decision Theory","author":"I Caragiannis","year":"2009","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On low-envy truthful allocations. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 111\u2013119. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_10"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/3457166","volume":"9","author":"M Chakraborty","year":"2021","unstructured":"Chakraborty, M., Igarashi, A., Suksompong, W., Zick, Y.: Weighted envy-freeness in indivisible item allocation. ACM Trans. Econ. Comput. 9(3), 18:1-18:39 (2021)","journal-title":"ACM Trans. Econ. Comput."},{"key":"18_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103578","volume":"301","author":"M Chakraborty","year":"2021","unstructured":"Chakraborty, M., Schmidt-Kraepelin, U., Suksompong, W.: Picking sequences and monotonicity in weighted fair division. Artif. Intell. 301, 103578 (2021)","journal-title":"Artif. Intell."},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/3665799","volume":"12","author":"M Chakraborty","year":"2024","unstructured":"Chakraborty, M., Segal-Halevi, E., Suksompong, W.: Weighted fairness notions for indivisible items revisited. ACM Trans. Econ. Comput. 12(3), 9:1-9:45 (2024)","journal-title":"ACM Trans. Econ. Comput."},{"key":"18_CR16","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Economic Essays, pp. 45\u201398 (1967)"},{"key":"18_CR17","unstructured":"Gamow, G., Stern, M.: Puzzle-Math. Viking Press (1958)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Weighted EF1 and PO allocations with few types of agents or chores. In: IJCAI, pp. 2799\u20132806. ijcai.org (2024)","DOI":"10.24963\/ijcai.2024\/310"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103633","volume":"303","author":"M Ghodsi","year":"2022","unstructured":"Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: beyond additive valuations. Artif. Intell. 303, 103633 (2022)","journal-title":"Artif. Intell."},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-64946-3_26","volume-title":"Web and Internet Economics","author":"D Halpern","year":"2020","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: one rule to rule them all. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 370\u2013383. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_26"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC, pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"key":"18_CR22","unstructured":"Markakis, E: Approximation algorithms and hardness results for fair division with indivisible goods. Trends in Computational Social Choice, pp. 231\u2013247 (2017)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-25510-6_24","volume-title":"Internet and Network Economics","author":"E Markakis","year":"2011","unstructured":"Markakis, E., Psomas, C.-A.: On worst-case allocations in the presence of indivisible goods. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 278\u2013289. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25510-6_24"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Springer, M., Hajiaghayi, M., Yami, H.: Almost envy-free allocations of indivisible goods or chores with entitlements. In: AAAI, pp. 9901\u20139908. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i9.28851"},{"key":"18_CR25","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":"18_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2024.106519","volume":"187","author":"W Suksompong","year":"2025","unstructured":"Suksompong, W.: Weighted fair division of indivisible items: a review. Inf. Process. Lett. 187, 106519 (2025)","journal-title":"Inf. Process. Lett."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.mathsocsci.2022.03.004","volume":"117","author":"W Suksompong","year":"2022","unstructured":"Suksompong, W., Teh, N.: On maximum weighted Nash welfare for binary valuations. Math. Soc. Sci. 117, 101\u2013108 (2022)","journal-title":"Math. Soc. Sci."},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.mathsocsci.2023.09.004","volume":"126","author":"W Suksompong","year":"2023","unstructured":"Suksompong, W., Teh, N.: Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness. Math. Soc. Sci. 126, 48\u201359 (2023)","journal-title":"Math. Soc. Sci."},{"key":"18_CR29","unstructured":"Tao, B., Yang, M.: Fair and almost truthful mechanisms for additive valuations and beyond. arXiv preprint: arXiv:2306.15920 (2023)"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Viswanathan, V., Zick, Y.: A general framework for fair allocation under matroid rank valuations. In: EC, pp. 1129\u20131152. ACM (2023)","DOI":"10.1145\/3580507.3597675"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, C., Zhou, S.: Weighted EF1 allocations for indivisible chores. In: EC, p. 1155. ACM (2023)","DOI":"10.1145\/3580507.3597763"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Xiao, M., Ling, J.: Algorithms for manipulating sequential allocation. In: AAAI, pp. 2302\u20132309. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5608"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-8312-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:15:07Z","timestamp":1751192107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-8312-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819683116","9789819683123"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-8312-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs-faw.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}