{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T18:33:05Z","timestamp":1774377185164,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T00:00:00Z","timestamp":1273795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10107-010-0356-8","type":"journal-article","created":{"date-parts":[[2010,5,13]],"date-time":"2010-05-13T13:04:37Z","timestamp":1273755877000},"page":"285-316","source":"Crossref","is-referenced-by-count":4,"title":["Efficient and fair routing for mesh networks"],"prefix":"10.1007","volume":"124","author":[{"given":"Andrea","family":"Lodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Malaguti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s E.","family":"Stier-Moses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,14]]},"reference":[{"key":"356_CR1","doi-asserted-by":"crossref","unstructured":"Anderegg, L., Eidenbenz, S.: Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom), pp.\u00a0245\u2013259. ACM Press, New York (2003)","DOI":"10.1145\/938985.939011"},{"key":"356_CR2","doi-asserted-by":"crossref","unstructured":"Beccaria, G., Bolelli, A.: Modelling and assessment of dynamic route guidance: the margot project. In: Olaussen, L., Helli, E. (eds.) Proceedings of the 3rd IEEE Vehicle Navigation & Information Systems Conference, pp.\u00a0117\u2013126. Oslo (1992)","DOI":"10.1109\/VNIS.1992.639943"},{"key":"356_CR3","volume-title":"Discrete Choice Analysis: Theory and Application to Travel Demand, Volume 9 of Transportation Studies Series","author":"M.E. Ben-Akiva","year":"1985","unstructured":"Ben-Akiva M.E., Lerman S.: Discrete Choice Analysis: Theory and Application to Travel Demand, Volume 9 of Transportation Studies Series. MIT Press, Cambridge (1985)"},{"key":"356_CR4","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas D., Gallager R.: Data Networks. Prentice Hall, Englewood Cliffs (1992)"},{"key":"356_CR5","doi-asserted-by":"crossref","unstructured":"Bhargava, R., Goel, A., Meyerson, A.: Using approximate majorization to characterize protocol fairness. In: Proceedings of the 2001 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp.\u00a0330\u2013331. ACM Press, New York (2001)","DOI":"10.1145\/378420.378826"},{"key":"356_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin A., El-Yaniv R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"356_CR7","doi-asserted-by":"crossref","unstructured":"Buchegger, S., Le Boudec, J.-Y.: Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks. In: Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp.\u00a0403\u2013410 (2002)","DOI":"10.1109\/EMPDP.2002.994321"},{"key":"356_CR8","doi-asserted-by":"crossref","unstructured":"Buchegger, S., Le Boudec, J.-Y.: Performance analysis of the CONFIDANT protocol. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), Lausanne, Switzerland, pp.\u00a0226\u2013236. ACM Press, New York (2002)","DOI":"10.1145\/513800.513828"},{"issue":"5","key":"356_CR9","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1023\/A:1025146013151","volume":"8","author":"L. Butty\u00e1n","year":"2003","unstructured":"Butty\u00e1n L., Hubaux J.-P.: Stimulating cooperation in self-organizing mobile ad hoc networks. Mobile Netw. Appl. 8(5), 579\u2013592 (2003)","journal-title":"Mobile Netw. Appl."},{"key":"356_CR10","unstructured":"Canalys: Canalys research release 2008\/112. http:\/\/www.canalys.com\/pr\/2008\/r2008112.htm (2008)"},{"key":"356_CR11","doi-asserted-by":"crossref","unstructured":"Chun, B., Fonseca, R., Stoica, I. Kubiatowicz, J.: Characterizing selfishly constructed overlay routing networks. In: Proceedings of 23rd Annual IEEE INFOCOM, vol. 2, pp.\u00a01329\u20131339 (2004)","DOI":"10.1109\/INFCOM.2004.1357018"},{"issue":"2","key":"356_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/opre.1070.0383","volume":"55","author":"J.R. Correa","year":"2007","unstructured":"Correa J.R., Schulz A.S., Stier-Moses N.E.: Fast, fair, and efficient flows in networks. Oper. Res. 55(2), 215\u2013225 (2007)","journal-title":"Oper. Res."},{"key":"356_CR13","volume-title":"Multicriteria optimization, Lecture Notes in Economics and Mathematical Systems","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott M.: Multicriteria optimization, Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (2000)"},{"issue":"2","key":"356_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11036-005-4468-y","volume":"11","author":"S. Eidenbenz","year":"2006","unstructured":"Eidenbenz S., Anil Kumar V.S., Zust S.: Equilibria in topology control games for ad hoc networks. Mobile Netw. Appl. 11(2), 143\u2013159 (2006)","journal-title":"Mobile Netw. Appl."},{"key":"356_CR15","volume-title":"Game Theory","author":"D. Fudenberg","year":"1991","unstructured":"Fudenberg D., Tirole J.: Game Theory. MIT Press, Cambridge (1991)"},{"key":"356_CR16","doi-asserted-by":"crossref","unstructured":"He, Q., Wu, D., Khosla, P.: SORI: a secure and objective reputation-based incentive scheme for ad hoc networks. In Wireless Communications and Networking Conference, vol. 2, pp.\u00a0825\u2013830 (2004)","DOI":"10.1109\/WCNC.2004.1311293"},{"issue":"7","key":"356_CR17","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/TCOM.1981.1095081","volume":"29","author":"J. Jaffe","year":"1981","unstructured":"Jaffe J.: Bottleneck flow control. IEEE Trans. Commun. 29(7), 954\u2013962 (1981)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"356_CR18","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O. Jahn","year":"2005","unstructured":"Jahn O., M\u00f6hring R.H., Schulz A.S., Stier-Moses N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53(4), 600\u2013616 (2005)","journal-title":"Oper. Res."},{"issue":"3","key":"356_CR19","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1019108223561","volume":"4","author":"H. Ji","year":"1998","unstructured":"Ji H., Huang C.-Y.: Non-cooperative uplink power control in cellular radio systems. Wirel. Netw. 4(3), 233\u2013240 (1998)","journal-title":"Wirel. Netw."},{"key":"356_CR20","first-page":"350","volume-title":"LATIN 2008: Theoretical Informatics, B\u00fazios, Brazil, Volume 4957 of Lecture Notes in Computer Science.","author":"G. Karakostas","year":"2008","unstructured":"Karakostas G., Markou E. et\u00a0al.: Emergency connectivity in ad-hoc networks with selfish nodes. In: Laber, E.S. (eds) LATIN 2008: Theoretical Informatics, B\u00fazios, Brazil, Volume 4957 of Lecture Notes in Computer Science., pp. 350\u2013361. Springer, Heidelberg (2008)"},{"issue":"1","key":"356_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1055959.1055963","volume":"9","author":"A. Kesselman","year":"2005","unstructured":"Kesselman A., Kowalski D., Segal M.: Energy efficient communication in ad hoc networks from user\u2019s and designer\u2019s perspective. Mobile Comput. Commun. Rev. 9(1), 15\u201326 (2005)","journal-title":"Mobile Comput. Commun. Rev."},{"issue":"4","key":"356_CR22","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TNET.2005.852888","volume":"13","author":"J.W. Lee","year":"2005","unstructured":"Lee J.W., Mazumdar R.R., Shroff N.B.: Downlink peer allocation for multi-class wireless system. IEEE\/ACM Trans. Netw. 13(4), 854\u2013867 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"356_CR23","unstructured":"Levin, D.: Punishment in selfish wireless networks: a game theoretic analysis. In: Proceedings of the First Workshop on the Economics of Networked Systems (NetEcon), pp.\u00a09\u20134. Ann Arbor (2006)"},{"key":"356_CR24","doi-asserted-by":"crossref","unstructured":"Lodi, A., Malaguti, E., Stier-Moses, N.E.: Efficient and fair routing for mesh networks. http:\/\/optimization.online.org (2010)","DOI":"10.1007\/s10107-010-0356-8"},{"key":"356_CR25","unstructured":"Mahajan, R., Rodrig, M., Wetherall, D., Zahorjan, J.: Sustaining cooperation in multihop wireless networks. In: Proceedings of the 2nd Symposium on Networked Systems Design & Implementation, vol. 2, pp.\u00a0231\u2013244. USENIX Association, Berkeley (2005)"},{"key":"356_CR26","doi-asserted-by":"crossref","unstructured":"Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of the 6th Annual ACM\/IEEE International Conference on Mobile Computing and Networking, pp.\u00a0255\u2013265. ACM Press, New York (2000)","DOI":"10.1145\/345910.345955"},{"key":"356_CR27","doi-asserted-by":"crossref","unstructured":"Milan, F., Jaramillo, J.J., Srikant, R.: Achieving cooperation in multihop wireless networks of selfish nodes. In: Proceedings of the Workshop on Game Theory for Communications and Networks (GameNets), Pisa, Italy. ACM Press, New York (2006)","DOI":"10.1145\/1190195.1190197"},{"key":"356_CR28","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan N., Roughgarden T., Tardos E., Vazirani V.V.: Algorithmic Game Theory. Cambridge University Press, UK (2007)"},{"key":"356_CR29","unstructured":"OLPC: Networking scenarios. http:\/\/wiki.laptop.org\/go\/Networking_scenarios (2008)"},{"key":"356_CR30","volume-title":"Wireless Communications: Principles and Practices","author":"T. Rappaport","year":"1996","unstructured":"Rappaport T.: Wireless Communications: Principles and Practices. Prentice Hall, Englewood Cliffs (1996)"},{"key":"356_CR31","unstructured":"Roughgarden, T.: How unfair is optimal routing? In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp.\u00a0203\u2013204. SIAM, Philadelphia (2002)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0356-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0356-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0356-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T21:20:26Z","timestamp":1740086426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0356-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,14]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0356-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,14]]}}}