{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:40:19Z","timestamp":1743133219671,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319175089"},{"type":"electronic","value":"9783319175096"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17509-6_4","type":"book-chapter","created":{"date-parts":[[2015,4,16]],"date-time":"2015-04-16T08:45:53Z","timestamp":1429173953000},"page":"47-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nash Equilibria for Multi-agent Network Flow with Controllable Capacities"],"prefix":"10.1007","author":[{"given":"Nadia Chaabane","family":"Fakhfakh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Briand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Jos\u00e9","family":"Huguet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,17]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/TITS.2010.2048313","volume":"11","author":"B Chen","year":"2010","unstructured":"Chen, B., Cheng, H.H.: A review of the applications of agent technology in traffic and transportation systems. IEEE Trans. Intell. Transp. Syst. 11(2), 485\u2013497 (2010)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10458-008-9050-0","volume":"17","author":"M Pechoucek","year":"2008","unstructured":"Pechoucek, M., Marik, V.: Industrial deployment of multi-agent technologies: review and selected case studies. Auton. Agent. Multi-Agent Syst. 17(3), 397\u2013431 (2008)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"4_CR3","unstructured":"Briand, C., Agnetis, A., Billaut, J.C.: The multiagent project scheduling problem: complexity of finding an optimal Nash equilibrium. In: Proceedings of PMS Conference, pp. 106\u2013109 (2012)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/07408170490257835","volume":"36","author":"F Zhang","year":"2004","unstructured":"Zhang, F., Roundy, R., Akanyildrim, M.C., Huh, W.T.: Optimal capacity expansion for multi-product, multi-machine manufacturing systems with stochastic demand. IIE Trans. 36(1), 23\u201326 (2004)","journal-title":"IIE Trans."},{"issue":"9","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1057\/jors.1994.169","volume":"45","author":"S Malcolm","year":"1994","unstructured":"Malcolm, S., Zenios, S.: Robust optimization for power systems capacity expansion under uncertainty. J. Oper. Res. Soc. 45(9), 1040\u20131049 (1994)","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"4_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/mnsc.44.11.S101","volume":"44","author":"M Laguna","year":"1998","unstructured":"Laguna, M.: Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Manage. Sci. 44(11), 101\u2013110 (1998)","journal-title":"Manage. Sci."},{"issue":"1","key":"4_CR7","first-page":"44","volume":"4","author":"VN Hsu","year":"2002","unstructured":"Hsu, V.N.: Dynamic capacity expansion problem with deferred expansion and age-dependent shortage cost. Manage. Sci. 4(1), 44\u201354 (2002)","journal-title":"Manage. Sci."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T Magnanti","year":"1984","unstructured":"Magnanti, T., Wong, R.: Network design and transportation planning: models and algorithms. Transp. Sci. 18(1), 1\u201355 (1984)","journal-title":"Transp. Sci."},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1287\/mnsc.5.4.472","volume":"5","author":"DR Fulkerson","year":"1959","unstructured":"Fulkerson, D.R.: Increasing the capacity of a network: the parametric budget problem. Manage. Sci. 5(4), 472\u2013483 (1959)","journal-title":"Manage. Sci."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1002\/net.20183","volume":"50","author":"F Ordonez","year":"2007","unstructured":"Ordonez, F., Zhao, J.: Robust capacity expansion of network flow. Networks 50(2), 136\u2013145 (2007)","journal-title":"Networks"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1017\/CBO9780511800481.021","volume-title":"Algorithmic Game Theory","author":"E Tardos","year":"2007","unstructured":"Tardos, E., Wexler, T.: Network formation games and the potential function method. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 487\u2013516. Cambridge University Press, Cambridge (2007)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-24829-0_20","volume-title":"Algorithmic Game Theory","author":"KR Apt","year":"2011","unstructured":"Apt, K.R., Markakis, E.: Diffusion in social networks with competing products. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 212\u2013223. Springer, Heidelberg (2011)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-03816-7_54","volume-title":"Mathematical Foundations of Computer Science 2009","author":"E Resnick","year":"2009","unstructured":"Resnick, E., Bachrach, Y., Meir, R., Rosenschein, J.S.: The cost of stability in network flow games. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 636\u2013650. Springer, Heidelberg (2009)"},{"issue":"5","key":"4_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0263-7863(98)00041-6","volume":"17","author":"R Evaristo","year":"1999","unstructured":"Evaristo, R., Van Fenema, P.C.: A typology of project management: emergence and evolution of new forms. Int. J. Proj. Manage. 17(5), 275\u2013281 (1999)","journal-title":"Int. J. Proj. Manage."},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/opre.45.2.302","volume":"45","author":"P De","year":"1997","unstructured":"De, P., Dunne, E.J., Ghosh, J.B., Wells, C.E.: Complexity of the discrete time-cost tradeoff problem for project networks. Eur. J. Oper. Res. 45(2), 302\u2013306 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.ejor.2011.08.015","volume":"216","author":"MA Estevez","year":"2012","unstructured":"Estevez, M.A.: Fernandez: a game theoretical approach to sharing penalties and rewards in projects. Eur. J. Oper. Res. 216(3), 647\u2013657 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10951-014-0393-x","volume":"18","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Briand, C., Billaut, J.-C., Sucha, P.: Nash equilibria for the multi-agent project scheduling problem with controllable processing times. J. Sched. 18(1), 15\u201327 (2014)","journal-title":"J. Sched."},{"issue":"4","key":"4_CR18","first-page":"401","volume":"22","author":"J Kamburowski","year":"1994","unstructured":"Kamburowski, J.: On the minimum cost project schedule. Int. J. Manage. Sci. 22(4), 401\u2013407 (1994)","journal-title":"Int. J. Manage. Sci."},{"key":"4_CR19","unstructured":"Briand, C., Sucha, P., Ngueveu, S.U.: Finding an optimal Nash equilibrium to the multi-agent project scheduling problem. J. Oper. Res (Submitted to)"},{"issue":"1","key":"4_CR20","first-page":"30","volume":"51","author":"GP Cachon","year":"2005","unstructured":"Cachon, G.P., Lariviere, M.A.: Supply chain coordination with revenue-sharing contracts: strengths and limitations. Int. J. Manage. Sci. 51(1), 30\u201344 (2005)","journal-title":"Int. J. Manage. Sci."},{"key":"4_CR21","first-page":"487","volume-title":"Multicriteria Optimization. Algorithmic Game Theory","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Algorithmic Game Theory, pp. 487\u2013516. Springer, New York (2005)"},{"key":"4_CR22","volume-title":"Flow in Networks","author":"LR Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Flow in Networks. Princeton University Press, Princeton (1958)"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811654","volume-title":"Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations","author":"Y Shoham","year":"2009","unstructured":"Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, New York (2009). ISBN 978-0-521-89943-7"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Busacker, R.G., Gowen, P.J.: A Procedure for Determining a Family of Minimal-Cost Network Flow Patterns. Defense Technical Information Center, 15th edn. (1961)","DOI":"10.21236\/AD0249662"},{"key":"4_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17509-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:55:37Z","timestamp":1676451337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17509-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319175089","9783319175096"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17509-6_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}