{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:45:39Z","timestamp":1757540739981},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_7","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:59:37Z","timestamp":1196665177000},"page":"30-41","source":"Crossref","is-referenced-by-count":4,"title":["A Unified Approach to Congestion Games and Two-Sided Markets"],"prefix":"10.1007","author":[{"given":"Heiner","family":"Ackermann","sequence":"first","affiliation":[]},{"given":"Paul W.","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: Proc. of the 47th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 613\u2013622 (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11944874_6","volume-title":"Internet and Network Economics","author":"H. Ackermann","year":"2006","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash equilibria in player-specific and weighted congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 50\u201361. Springer, Heidelberg (2006)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th Ann. ACM Symp. on Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","volume":"28","author":"T. Fleiner","year":"2003","unstructured":"Fleiner, T.: A fixed-point approach to stable matchings and some applications. Mathematics of Operations Research\u00a028(1), 103\u2013126 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proc. of the 16th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA), pp. 611\u2013620 (2006)","DOI":"10.1145\/1109557.1109624"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S.C., Koutsoupias, E., Mavronicolas, M., Spirakis, P.G.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proc. of the 36th Ann. ACM Symp. on Theory of Computing (STOC), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Goemans, M., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proc. of the 5th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 1020\u20131033 (2004)","DOI":"10.1145\/989459.989467"},{"key":"7_CR12","volume-title":"The stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1214\/009117906000000098","volume":"34","author":"C. Hoffman","year":"2006","unstructured":"Hoffman, C., Holroyd, A., Peres, Y.: A stable marriage of poisson and lebesgue. Annals of Probability\u00a034(4), 1241\u20131272 (2006)","journal-title":"Annals of Probability"},{"key":"7_CR14","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proc. of the 20th Nat. Conference on Artificial Intelligence (AAAI), pp. 489\u2013494 (2005)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"1999","unstructured":"Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 443\u2013452. Springer, Heidelberg (1999)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.2307\/1913392","volume":"50","author":"A. Kelso","year":"1982","unstructured":"Kelso, A., Crawford, V.: Job matchings, coalition formation, and gross substitute. Econometrica\u00a050, 1483\u20131504 (1982)","journal-title":"Econometrica"},{"key":"7_CR17","unstructured":"Knuth, D.: Marriage Stables et leurs relations avec d\u2019autres probl\u00e8mes Combinatories. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al (1976)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Kojima, F., \u00dcnver, M.U.: Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration. Int. Journal of Game Theory\u00a0 (2006)","DOI":"10.2139\/ssrn.888640"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior\u00a013(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"7_CR20","unstructured":"Mirrokni, V.S.: Approximation Algorithms for Distributed and Selfish Agents. PhD thesis, Massachusetts Institute of Technology (2005)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Int. Journal of Game Theory"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: A case study in game theory. Journal of Political Economy\u00a092, 991\u20131016 (1984)","journal-title":"Journal of Political Economy"},{"key":"7_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided Matching: A study in game-theoretic modeling and analysis","author":"A.E. Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-sided Matching: A study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge (1990)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:41Z","timestamp":1619521241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_7","relation":{},"subject":[]}}