{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:59Z","timestamp":1767339599616,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"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-64946-3_24","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"341-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Simultaneously Achieving Ex-ante and Ex-post Fairness"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"24_CR1","series-title":"Studies in Economic Design","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-18050-8_8","volume-title":"The Future of Economic Design","author":"H Aziz","year":"2019","unstructured":"Aziz, H.: A probabilistic approach to voting, allocation, matching, and coalition formation. In: Laslier, J.-F., Moulin, H., Sanver, M.R., Zwicker, W.S. (eds.) The Future of Economic Design. SED, pp. 45\u201350. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18050-8_8"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.artint.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Walsh, T.: Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227, 71\u201392 (2015)","journal-title":"Artif. Intell."},{"key":"24_CR3","unstructured":"Aziz, H., Huang, X., Mattei, N., Segal-Halevi, E.: The constrained round robin algorithm for fair and efficient allocation. CoRR abs\/1908.00161 (2019), http:\/\/arxiv.org\/abs\/1908.00161"},{"key":"24_CR4","unstructured":"Aziz, H., Mackenzie, S., Xia, L., Ye, C.: Ex post efficiency of random assignments. In: Proceedings of 14th AAMAS Conference, pp. 1639\u20131640 (2015)"},{"key":"24_CR5","unstructured":"Aziz, H., Walsh, T., Xia, L.: Possible and necessary allocations via sequential mechanisms. In: Proceedings of 24th IJCAI, pp. 468\u2013474 (2015)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-13129-0_1","volume-title":"Web and Internet Economics","author":"H Aziz","year":"2014","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 1\u201314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_1"},{"key":"24_CR7","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Three observations on linear algebra. Univ. Nac. Tacuman Rev. Ser. A 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tacuman Rev. Ser. A"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica 72(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"issue":"6","key":"24_CR10","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."},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1257\/aer.103.2.585","volume":"103","author":"E Budish","year":"2013","unstructured":"Budish, E., Che, Y.K., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: theory and applications. Am. Econ. Rev. 103(2), 585\u2013623 (2013)","journal-title":"Am. Econ. Rev."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of 17th ACM-EC Conference, pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N., Vaughan, J.W.: Group fairness for the allocation of indivisible goods. In: Proceedings of 33rd AAAI Conference (2019)","DOI":"10.1609\/aaai.v33i01.33011853"},{"issue":"5","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411512","volume":"55","author":"N Devanur","year":"2008","unstructured":"Devanur, N., Papadimitriou, C.H., Saberi, A., Vazirani, V.: Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5), 1\u20138 (2008)","journal-title":"J. ACM"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Freeman, R., Shah, N., Vaish, R.: Best of both worlds: ex-ante and ex-post fairness in resource allocation. Technical report (2020)","DOI":"10.1145\/3391403.3399537"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981). https:\/\/doi.org\/10.1007\/BF02579273","journal-title":"Combinatorica"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: one rule to rule them all. Technical report (2020)","DOI":"10.1007\/978-3-030-64946-3_26"},{"issue":"4","key":"24_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n$${}^{\\text{5\/2 }}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"24_CR19","first-page":"66","volume":"5","author":"AV Karzanov","year":"1973","unstructured":"Karzanov, A.V.: An exact estimate of an algorithm for finding a maximum flow, applied to the problem on representatives. Probl. Cybern. 5, 66\u201370 (1973)","journal-title":"Probl. Cybern."},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"AK Katta","year":"2006","unstructured":"Katta, A.K., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131(1), 231\u2013250 (2006)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"24_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.mathsocsci.2008.07.003","volume":"57","author":"F Kojima","year":"2009","unstructured":"Kojima, F.: Random assignment of multiple indivisible objects. Math. Soc. Sci. 57(1), 134\u2013142 (2009)","journal-title":"Math. Soc. Sci."},{"key":"24_CR22","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea Publishing, Providence (2009)"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9, 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Vazirani, V.V.: Combinatorial algorithms for market equilibria. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.) Algorithmic Game Theory, chap. 5, pp. 103\u2013134. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.007"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T18:28:14Z","timestamp":1618597694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_24","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":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"11","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":"23% - 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":"10","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)"}}]}}