{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:01Z","timestamp":1742914081200,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859466"},{"type":"electronic","value":"9783030859473"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_16","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"236-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Competitive Equilibrium with Generic Budget"],"prefix":"10.1007","author":[{"given":"Amin","family":"Ghiasi","sequence":"first","affiliation":[]},{"given":"Masoud","family":"Seddighin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"issue":"4","key":"16_CR1","first-page":"52","volume":"13","author":"G Amanatidis","year":"2017","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms (TALG) 13(4), 52 (2017)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1111\/j.1467-6419.1994.tb00098.x","volume":"8","author":"C Arnsperger","year":"1994","unstructured":"Arnsperger, C.: Envy-freeness and distributive justice. J. Econ. Surv. 8(2), 155\u2013186 (1994)","journal-title":"J. Econ. Surv."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2307\/1927286","volume":"43","author":"KJ Arrow","year":"1961","unstructured":"Arrow, K.J., Chenery, H.B., Minhas, B.S., Solow, R.M.: Capital-labor substitution and economic efficiency. Rev. Econ. Stat. 43, 225\u2013250 (1961)","journal-title":"Rev. Econ. Stat."},{"key":"16_CR4","first-page":"265","volume":"22","author":"KJ Arrow","year":"1954","unstructured":"Arrow, K.J., Debreu, G.: Existence of an equilibrium for a competitive economy. Econ. J. Econ. Soc. 22, 265\u2013290 (1954)","journal-title":"Econ. J. Econ. Soc."},{"key":"16_CR5","unstructured":"Babaioff, M., Nisan, N., Talgam-Cohen, I.: Competitive equilibria with indivisible goods and generic budgets. arXiv preprint arXiv:1703.08150 (2017)"},{"key":"16_CR6","unstructured":"Babaioff, M., Nisan, N., Talgam-Cohen, I.: Competitive equilibrium with generic budgets: beyond additive. arXiv preprint arXiv:1911.09992 (2019)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Nisan, N., Talgam-Cohen, I.: Fair allocation through competitive equilibrium from generic incomes. In: FAT, p. 180 (2019)","DOI":"10.1145\/3287560.3287582"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 50\u201359 (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: Approximation algorithms for maximin fair division. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 647\u2013664. ACM (2017)","DOI":"10.1145\/3033274.3085136"},{"key":"16_CR10","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Greedy algorithms for maximizing Nash social welfare. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 7\u201313. International Foundation for Autonomous Agents and Multiagent Systems (2018)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Bergemann, D., Brooks, B.A., Morris, S.: Selling to intermediaries: optimal auction design in a common value model (2017)","DOI":"10.2139\/ssrn.3018883"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. J. Artif. Intell. Res. 32, 525\u2013564 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Lema\u00eetre, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi-agent Syst. 30(2), 259\u2013290 (2016)","journal-title":"Auton. Agents Multi-agent Syst."},{"key":"16_CR14","unstructured":"Brainard, W.C., Scarf, H.E., et al.: How to Compute Equilibrium Prices in 1891. Cowles Foundation for Research in Economics (2000)"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s003550050019","volume":"17","author":"SJ Brams","year":"2000","unstructured":"Brams, S.J., Fishburn, P.C.: Fair division of indivisible items between two people with identical preferences: envy-freeness, pareto-optimality, and equity. Soc. Choice Welf. 17(2), 247\u2013267 (2000)","journal-title":"Soc. Choice Welf."},{"issue":"6","key":"16_CR16","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":"16_CR17","doi-asserted-by":"crossref","unstructured":"Cole, R.: Convex program duality, fisher markets, and Nash social welfare. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 459\u2013460 (2017)","DOI":"10.1145\/3033274.3085109"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 371\u2013380 (2015)","DOI":"10.1145\/2746539.2746589"},{"key":"16_CR19","unstructured":"Cole, R., Rastogi, A.: Indivisible markets with good approximate equilibrium prices. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 14, p. 017. Citeseer (2007)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 67\u201371. ACM (2002)","DOI":"10.1145\/509907.509920"},{"issue":"2","key":"16_CR21","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0022-0000(03)00011-4","volume":"67","author":"X Deng","year":"2003","unstructured":"Deng, X., Papadimitriou, C., Safra, S.: On the complexity of price equilibria. J. Comput. Syst. Sci. 67(2), 311\u2013324 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR22","first-page":"997","volume":"39","author":"E Dierker","year":"1971","unstructured":"Dierker, E.: Equilibrium analysis of exchange economies with indivisible commodities. Econ. J. Econ. Soc. 39, 997\u20131008 (1971)","journal-title":"Econ. J. Econ. Soc."},{"issue":"3","key":"16_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0165-4896(00)00065-2","volume":"41","author":"P Edelman","year":"2001","unstructured":"Edelman, P., Fishburn, P.: Fair division of indivisible items among people with similar preferences. Math. Soc. Sci. 41(3), 327\u2013347 (2001)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Stat. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Stat."},{"key":"16_CR25","unstructured":"Gjerstad, S.: Multiple equilibria in exchange economies with homothetic, nearly identical preference. University of Minnesota, Center for Economic Research, Discussion Paper, 288 (1996)"},{"key":"16_CR26","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: SODA, vol. 5, pp. 1164\u20131173. Citeseer (2005)"},{"issue":"1","key":"16_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0097539705447384","volume":"37","author":"K Jain","year":"2007","unstructured":"Jain, K.: A polynomial time algorithm for computing an Arrow-Debreu market equilibrium for linear utilities. SIAM J. Comput. 37(1), 303\u2013318 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"16_CR28","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2297640","volume":"53","author":"AP Kirman","year":"1986","unstructured":"Kirman, A.P., Koch, K.-J.: Market excess demand in exchange economies with identical preferences and collinear endowments. Rev. Econ. Stud. 53(3), 457\u2013463 (1986)","journal-title":"Rev. Econ. Stud."},{"key":"16_CR29","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R., et al.: Microeconomic Theory, vol. 1. Oxford University Press, New York (1995)"},{"issue":"4","key":"16_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2956583","volume":"4","author":"A Othman","year":"2016","unstructured":"Othman, A., Papadimitriou, C., Rubinstein, A.: The complexity of fairness through equilibrium. ACM Trans. Econ. Comput. (TEAC) 4(4), 1\u201319 (2016)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 675\u2013692. ACM (2014)","DOI":"10.1145\/2600057.2602835"},{"key":"16_CR32","unstructured":"Segal-Halevi, E.: Competitive equilibrium for almost all incomes: existence and fairness. arXiv preprint arXiv:1705.04212 (2017)"},{"issue":"1","key":"16_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-4068(85)90023-0","volume":"14","author":"D Weller","year":"1985","unstructured":"Weller, D.: Fair division of a measurable space. J. Math. Econ. 14(1), 5\u201317 (1985)","journal-title":"J. Math. Econ."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T14:11:47Z","timestamp":1641996707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"73","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":"26","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":"0","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":"36% - 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":"7.5","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":"4 abstracts of presented papers are also included.","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)"}}]}}