{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:27Z","timestamp":1763468247523},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131283"},{"type":"electronic","value":"9783319131290"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13129-0_16","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:08:41Z","timestamp":1417414121000},"page":"218-231","source":"Crossref","is-referenced-by-count":5,"title":["Biobjective Online Bipartite Matching"],"prefix":"10.1007","author":[{"given":"Gagan","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Pierrakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: SODA (2010)","DOI":"10.1137\/1.9781611973082.95"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Daskalakis, C., Micali, S., Matthew Weinberg, S.: Optimal and efficient parametric auctions. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, pp. 596\u2013604 (2013)","DOI":"10.1137\/1.9781611973105.43"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/s00453-007-9096-4","volume":"50","author":"N. Bhatnagar","year":"2008","unstructured":"Bhatnagar, N., Randall, D., Vazirani, V.V., Vigoda, E.: Random bichromatic matchings. Algorithmica\u00a050(4), 418\u2013445 (2008)","journal-title":"Algorithmica"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N. Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J(S.): Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Pierrakos, G.: Simple, optimal and efficient auctions. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol.\u00a07090, pp. 109\u2013121. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-25510-6_10"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-31585-5_44","volume-title":"Automata, Languages, and Programming","author":"I. Diakonikolas","year":"2012","unstructured":"Diakonikolas, I., Papadimitriou, C., Pierrakos, G., Singer, Y.: Efficiency-revenue trade-offs in auctions. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 488\u2013499. Springer, Heidelberg (2012)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J. Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 374\u2013385. Springer, Heidelberg (2009)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-45253-2_18","volume-title":"Algorithms - ESA 2000","author":"M. Flammini","year":"2000","unstructured":"Flammini, M., Nicosia, G.: On multicriteria online problems. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 191\u2013201. Springer, Heidelberg (2000)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Srikant, R.: Optimizing budget constrained spend in search advertising. In: WSDM (2013)","DOI":"10.1145\/2433396.2433483"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for online bipartite matching. In: STOC (1990)","DOI":"10.1145\/100216.100262"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Karzanov, A.V.: Maximum matching of given weight in complete and complete bipartite graphs. In: Cybernetics and Systems Analysis (1987)","DOI":"10.1007\/BF01068796"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-45046-4_25","volume-title":"Web and Internet Economics","author":"N. Korula","year":"2013","unstructured":"Korula, N., Mirrokni, V.S., Zadimoghaddam, M.: Bicriteria online matching: Maximizing weight and cardinality. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol.\u00a08289, pp. 305\u2013318. Springer, Heidelberg (2013)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"N. Korula","year":"2009","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A. Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Foundations and Trends in Theoretical Computer Science\u00a08(4), 265\u2013368 (2013)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"16_CR15","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. In: FOCS (2005)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: STOC (1987)","DOI":"10.1145\/28395.383347"},{"key":"16_CR17","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: FOCS (2000)"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0166-218X(01)00300-6","volume":"121","author":"T. Yi","year":"2002","unstructured":"Yi, T., Murty, K.G., Spera, C.: Matchings in colored bipartite networks. Discrete Applied Mathematics\u00a0121(1), 261\u2013277 (2002)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13129-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:16:23Z","timestamp":1559063783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13129-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131283","9783319131290"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13129-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}