{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:24Z","timestamp":1725559464814},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_9","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"77-88","source":"Crossref","is-referenced-by-count":1,"title":["Experimental Results for Stackelberg Scheduling Strategies"],"prefix":"10.1007","author":[{"given":"A. C.","family":"Kaporis","sequence":"first","affiliation":[]},{"given":"L. M.","family":"Kirousis","sequence":"additional","affiliation":[]},{"given":"E. I.","family":"Politopoulou","sequence":"additional","affiliation":[]},{"given":"P. G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-45465-9_66","volume-title":"Automata, Languages and Programming","author":"V.S. Anil Kumar","year":"2002","unstructured":"Anil Kumar, V.S., Marathe, M.V.: Improved Results for Stackelberg Scheduling Strategies. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 776\u2013787. Springer, Heidelberg (2002)"},{"key":"9_CR2","volume-title":"Dynamic Noncooperative Game Theory","author":"T. Basar","year":"1999","unstructured":"Basar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory. SIAM, Philadelphia (1999)"},{"key":"9_CR3","unstructured":"Czumaj, A., Voecking, B.: Tight bounds for worst-case equilibria. In: Proc. SODA 2002 (2002)"},{"key":"9_CR4","volume-title":"Selfish Routing on the Internet, Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"A. Czumaj","year":"2004","unstructured":"Czumaj, A.: Selfish Routing on the Internet, Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. In: Proc. STOC 2000 (2000)","DOI":"10.1145\/335305.335332"},{"key":"9_CR6","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., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: 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":"9_CR7","doi-asserted-by":"crossref","unstructured":"Golle, P., Leyton-Brown, K., Mironov, I., Lillibridge, M.: Incentives for Sharing in Peer-to-Peer Networks. In: Fiege, L., M\u00fchl, G., Wilhelm, U.G. (eds.) WELCOM 2001. LNCS, vol.\u00a02232, p. 75. Springer, Heidelberg (2001) (full version)","DOI":"10.1145\/501158.501193"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/25.618182","volume":"46","author":"S.A. Grandhi","year":"1997","unstructured":"Grandhi, S.A., Yates, R.D., Goodman, D.J.: Resource Allocation for Cellular Radio Systems. Proc. IEEE Transactions on Vehicular Technology\u00a046(3), 581\u2013587 (1997)","journal-title":"Proc. IEEE Transactions on Vehicular Technology"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using stackelberg routing strategies. Proc. IEEE\/ACM Transactions of Networking (1997)","DOI":"10.1109\/90.554730"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: The designer\u2019s perspective to noncooperative networks. In: Proc. IEEE INFOCOM 1995 (1995)","DOI":"10.1109\/INFCOM.1995.515922"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Capacity allocation under noncooperative routing. Proc. IEEE\/Transactions on Automatic Control (1997)","DOI":"10.1109\/9.557575"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 387\u2013396. Springer, Heidelberg (1999)"},{"key":"9_CR13","unstructured":"Lin, H., Roughgarden, T., Tardos, E.: A Stronger Bound on Braess\u2019s Paradox. In: SODA (2004)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Mavronikolas, M., Spirakis, P.: The price of Selfish Routing. In: Proc. STOC 2001 (2001)","DOI":"10.1145\/380752.380846"},{"key":"9_CR15","volume-title":"Game Theory: Analysis of Conflict","author":"R.B. Myerson","year":"1991","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard University Press, Cambridge (1991)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. STOC 1999, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49116-3_1","volume-title":"STACS 99","author":"N. Nisan","year":"1999","unstructured":"Nisan, N.: Algorithms for selfish agents: Mechanism design for distributed computation. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, p. 1. Springer, Heidelberg (1999)"},{"key":"9_CR18","unstructured":"Osborne, M.J., Rubinstein, A.: A course in Game Theory. MIT Press, Cambridge"},{"key":"9_CR19","volume-title":"Game Theory","author":"G. Owen","year":"1995","unstructured":"Owen, G.: Game Theory, 3rd edn. Academic Press, Orlando (1995)","edition":"3"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Game Theory and Mathematical Economics: A Theoratical Computer Scientist\u2019s Introduction. In: Proc. FOCS 2001 (2001)","DOI":"10.1109\/SFCS.2001.959877"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: Algorithms, Games, and the Internet. In: Proc. STOC 2001, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proc. STOC 2002, pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Proc. STOC 2001, pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, E.: How bad is Selfish Routing? In: Proc. FOCS 2000, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Designing networks for selfish users is hard. In: Proc. FOCS 2001, pp. 472\u2013481 (2001)","DOI":"10.1109\/SFCS.2001.959923"},{"key":"9_CR26","volume-title":"Marktform aund Gleichgewicht","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform aund Gleichgewicht. Spiringer, Heidelberg (1934)"},{"key":"9_CR27","unstructured":"Yaiche, H., Mazumdar, R., Rosenberg, C.: Distributed algorithms for fair bandwidth allocation in broadband networks. In: Proc. INFOCOM 2000 (2000)"},{"issue":"5","key":"9_CR28","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/90.879352","volume":"8","author":"H. Yaiche","year":"2000","unstructured":"Yaiche, H., Mazumdar, R., Rosenberg, C.: A game-theoretic framework for bandwidth allocation and pricing in broadband networks. Proc. the IEEE\/ACM Transactions on Networking\u00a08(5), 667\u2013678 (2000)","journal-title":"Proc. the IEEE\/ACM Transactions on Networking"},{"key":"9_CR29","unstructured":"Optimization Toolbox for use with MATLAB, User\u2019s Guide, MathWorks"},{"key":"9_CR30","unstructured":"http:\/\/students.ceid.upatras.gr\/~politop\/stackTop , Stackelberg Strategies Toolbox"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:52Z","timestamp":1605642952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11427186_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}