[1] H. Z., Aashtiani and T. L., Magnanti. Equilibria on a congested transportation network. SIAM Journal of Algebraic and Discrete Methods, 2:213–226, 1981.
[2] V., Abhishek and B., Hajek. On the incentive to deviate in core selecting combinatorial auctions. In Proceedings of Workshop on Telecom Economics, Engineering and Policy, Krakow, 2012.
[3] D., Acemoglu, K., Bimpikis, and A., Ozdaglar. Price and capacity competition. Games and Economic Behavior, 66:1–26, 2009.
[4] E., Adar and B., Huberman. Free riding on Gnutella. First Monday, 5(10), October 2000.
[5] M. H., Afrasiabi and R., Guerin. Exploring user-provided connectivity: A simple model. In Proceedings of 7th International Workshop on Advanced Internet Charging and QoS Technology (ICQT), Paris, 2011.
[6] G., Aggarwal, J., Feldman, S., Muthukrishnan, and M., Pal. Sponsored search auctions with Markovian users. In Workshop on Internet and Network Economics (WINE), pages 621–628, 2008.
[7] A. Al, Daoud, M., Alanyali, and D., Starobinski. Pricing strategies for spectrum lease in secondary markets. IEEE/ACM Transactions on Networking, 18(2):462–475, 2010.
[8] T., Alford and G., Morton. The Economics of Cloud Computing Addressing the Benefits of Infrastructure in the Cloud. Technical report, Booz Allen Hamilton, 2010.
[9] G., Allon and A., Federgruen. Service competition with general queueing facilities. Operations Research, 56(4):827–849, 2008.
[10] T., Alpcan and T., Basar. A game theoretic approach to decision and analysis in network intrusion detection. In Proceedings of 42nd IEEE Conference on Decision and Control, Maui, HI, 2003.
[11] T., Alpcan, T., Bassar, R., Srikant, and E., Altman. CDMA uplink power control as a noncooperative game. Wireless Networks, 8(6):659–670, 2002.
[12] E., Altman, M. K., Hanawal, and R., Sundaresan. Nonneutral network and the role of bargaining power in side payments. Available at http://arxiv.org/abs/1204.4647, 2012.
[13] E., Altman, V., Kamble, and H., Kameda. A Braess type paradox in power control over interference channels. In Proceedings of Physicomnet, WiOpt, Berlin, 2008.
[14] E., Altman, A., Legout, and Y., Xu. Network non-neutrality debate: An economic analysis. In Proceedings of Networking 2011, pages 68–81, Barcelona, 2011.
[15] L., Anderegg and S., Eidenbenz. Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In Proceedings of 9th Annual International Conference on Mobile Computing and Networking (MobiCom 2003), pages 245–259, San Diego, CA, 2003.
[16] B., Andersen and M., Frenz. The impact of music downloads and P2P file-sharing on the purchase of music: A study for industry Canada. http://strategis.ic.gc.ca/epic/site/ippd-dppi.nsf/en/hip01456e.html, 2007.
[17] B., Andersen and M., Frenz. Don't blame the P2P file-sharers: The impact of free music downloads on the purchase of music CDs in Canada. Journal of Evolutionary Economics, 20:715–740, 2010.
[18] N., Andreasson, A., Evgrafov, and M., Patriksson. An Introduction to Continuous Optimization. Lund: Studentlitteratur, 2007.
[19] P., Antoniadis. Economic Modelling and Incentive Mechanisms for Efficient Resource Provision in Peer-to-Peer Systems. PhD thesis, Athens University of Economics and Business, 2006.
[20] ARCEP. Neutralité de l'internet et des réseaux: propositions et orientations. http://www.arcep.fr/uploads/tLgspublication/net-neutralite-orientations-sept2010.pdf, 2010.
[21] ARCEP. ARCEP publishes the results of the awards procedure for 4G licences in the 2.6 GHz frequency band. http://www.arcep.fr/index.php?id=8571&L=1&tx_gsactualite_pi1 \%5 Buid\%5D=1431\&tx_gsactualite_pi1\%5BbackID\%5D=1\&cHash=136860fe4e, 2011.
[22] A., Arlandis and E., Baranes. Interactions between network operators, content producers and internet intermediaries: Empirical implications of network neutrality. Intereconomics, 46(2):98–105, 2011.
[23] M., Armbrust, A., Fox, R., Griffithet al.A view of cloud computing. Communications of the ACM, 53(4):50–58, 2010.
[24] I., Ashlagi, D., Monderer, and M., Tennenholtz. Competing ad auctions. In Proceedings of the 4th Workshop on Ad Auctions, Chicago, IL, 2008.
[25] R., Aumann. Subjectivity and correlation in randomized strategies. Journal of Mathematical Economics, 1(1):67–96, 1974.
[26] R., Aumann and L., Shapley. Long term competition: A game theoretic analysis. Mimeo, Hebrew University, 1976.
[27] R. J., Aumann. What is game theory trying to accomplish? In K., Arrow and S., Honkapohja, editors, Frontiers in Economics, pages 28–76. Oxford: Blackwell, 1985.
[28] R. J., Aumann. Rationality and bounded rationality. Games and Economic Behavior, 21:2–14, 1997.
[29] D., Austin. How Google finds your needle in the web's haystack. American Mathematical Society Feature Column, 10(12), 2006. http://www.ams.org/samplings/feature-column/fcarc-pagerank.
[30] K., Avrachenkov and N., Litvak. Decomposition of the Google Page Rank and Optimal Linking Strategy. Rapport de recherche RR-5101, INRIA, 2004.
[31] Y., Bakos and E., Brynjolfsson. Bundling information goods: Pricing, profits, and efficiency. Management Science, 45(12):1613–1630, 1999.
[32] A., Banerjee and C. M., Dippon. Voluntary relationships among mobile network operators and mobile virtual network operators: An economic explanation. Information Economics and Policy, 21:72–84, 2009.
[33] M., Beckmann, C. B., McGuire, and C. B., Winsten. Studies in the Economics of Transportation. New Haven, CN: Yale University Press, 1956.
[34] M., Ben-Akiva and S., Lerman. Discrete Choice Analysis. Cambridge, MA: MIT Press, 1985.
[35] C., Berge. Espaces topologiques. Fonctions multivoques. Paris: Dunod, 1959.
[36] U., Berger. Brown's original fictitious play. Journal of Economic Theory, 135(1):572–578, 2007.
[37] D. P., Bertsekas. Dynamic Programming and Optimal Control. Belmont, MA: Athena Scientific, 1995.
[38] D. P., Bertsekas. Nonlinear Programming. Belmont, MA: Athena Scientific, 2nd edition, 1999.
[39] S., Bistarelli, M., Dall'Aglio, and P., Peretti. Strategic games on defense trees. In Proceedings of 4th International Workshop on Formal Aspects in Security and Trust (FAST '06), LNCS 4691, pages 1–15, Hamilton, Ontario, 2006.
[40] C., Blumrosen, J. D., Hartline, and S., Nong. Position auctions and non-uniform conversion rates. In Proceedings of 4th Workshop on Ad Auctions, Chicago, IL, 2008.
[41] N., Bohacek, J. P., Hespanha, J., Lee, C., Lim, and K., Obraczka. Game theoretic stochastic routing for fault tolerance and security in computer networks. IEEE Transactions on Parallel and Distributed Systems, 18(9):1227–1240, 2007.
[42] R., Bohn, H. W., Braun, K. C., Claffy, and S., Wolff. Mitigating the Coming Internet Crunch: Multiple Service Levels via Precedence. Technical report, University of California, San Diego, 1993.
[43] F., Boussion, P., Maille, and B., Tuffin. Net neutrality debate: Impact of competition among ISPs. In Proceedings of the Fourth International Conference on COMmunication Systems and NETworkS (COMSNETS), Bangalore, 2012.
[44] D., Braess. Uber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, 12:258–268, 1968.
[45] J., Bredin, R. T., Maheswaran, C., Imeret al.A game-theoretic formulation of multi-agent resource allocation. In Proceedings of the 4th International Conference on Autonomous Agents, 2000.
[46] S., Buehler, R., Dewenter, and J., Haucap. Mobile number portability in Europe. Telecommunications Policy, 30(7):385–399, 2006.
[47] C., Buragohain, D., Agrawal, and S., Suri. A game theoretic framework for incentives in P2P systems. In Proceedings of the 3rd International Conference on Peer-to-Peer Computing, P2P '03, pages 48–56, Washington, DC, 2003.
[48] L., Buttyan and J.-P., Hubaux. Enforcing service availability in mobile ad-hoc WANs. In Proceedings of 1st IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC), Boston, MA, 2000.
[49] L., Buttyan and J.-P., Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks. Mobile Networks and Applications, 8(5):579–592, 2003.
[50] S., Caron, G., Kesidis, and E., Altman. Application neutrality and aparadox of side payments. In Proceedings of the Third International Workshopon Re-Architectingthe Internet (ReArch 2010), Philadelphia, PA, 2010.
[51] D., Chakrabarty, Y., Zhou, and R., Lukose. Budget constrained bidding in keyword auctions and online knapsack problems. In Workshop on Internet and Network Economics (WINE), pages 566–576, 2008.
[52] R., Chandramouli. Economics of security: Research challenges. In Proceedings of the 16th International Conference on Computer Communications and Networks (ICCCN '2007), Hawaii, HI, 2007.
[53] C. K., Chau and K. M., Sim. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Operations Research Letters, 31:327–334, 2003.
[54] C.-K., Chau, Q., Wang, and D.-M., Chiu. On the viability of Paris metro pricing for communication and service networks. In Proceedings of the 29th Conference on Information Communications, INFOCOM '10, pages 929–937, Piscataway, NJ, 2010.
[55] H., Chen and Y., Li. Intelligent flow control under game theoretic framework. In D. W., Come, G. D., Smith, and M. J., Oats, editors, Telecommunications Optimization: Heuristic and Adaptive Techniques. New York: John Wiley & Sons, 2000.
[56] D., Clark, B., Lehr, S., Baueret al.The growth of internet overlay networks: Implications for architecture, industry structure and policy. In Proceedings of Telecommunications Policy Research Conference (TPRC-05), 2005.
[57] D. D., Clark. Internet cost allocation and pricing. In Lee W., McKnight and Joseph P., Bailey, editors, Internet Economics, pages 215–252. Cambridge, MA: MIT Press, 1997.
[58] E. H., Clarke. Multipart pricing of public goods. Public Choice, 11:17–33, 1971.
[59] R., Cocchi, D., Estrin, S., Shenker, and L., Zhang. A study of priority pricing in multiple service class networks. In Proceedings of SIGCOMM '91, pages 123–130, 1991.
[60] Federal Communications Commission. In the matter of expanding the economic and innovation opportunities of spectrum through incentive auctions. Notice of proposed rulemak-ing. Available at http://www.fcc.gov/document/broadcast-television-spectrum-incentive-auction-nprm, 2012.
[61] W. J., Cook, W. H., Cunningham, and W. R., Pulleyblank. Combinatorial Optimization. New York: John Wiley & Sons, 1998.
[62] J. R., Correa, A. S., Schulz, and N. E., Stier-Moses. Selfish routing in capacitated networks. Mathematics of Operations Research, 29(4):961–976, 2004.
[63] P., Coucheney, G., D'Acquisto, P., Maille, M., Naldi, and B., Tuffin. Influence of Search Neutrality on the Economics of Advertisement-Financed Content. Working paper, 2013.
[64] P., Coucheney, P., Maille, and B., Tuffin. Comparison of search engines non-neutral and neutral behaviors. SIGMETRICS Performance Evaluation Review, 40(2):14–17, 2012.
[65] P., Coucheney, P., Maille, and B., Tuffin. Impact of Reputation-Sensitive Users and Competition between ISPs on the Net Neutrality Debate. Rapport de recherche, INRIA, 2012.
[66] P., Coucheney, P., Maille, and B., Tuffin. Network Neutrality Debate and ISP Inter-relations: Traffic Exchange, Revenue Sharing, and Disconnection Threat. Working paper, available at http://hal.inria.fr/hal-00659278/fr/, 2012.
[67] C., Courcoubetis, M. P., Dramitinos, and G. D., Stamoulis. An auction mechanism for bandwidth allocation over paths. In Proceedings of the 17th International Teletraffic Congress (ITC), 2001.
[68] P., Cramton. The FCC spectrum auctions: An early assessment. Journal of Economics and Management Strategy, 6(3):431–495, 1997.
[69] P., Cramton. Lessons from the United States spectrum auctions. Prepared testimony before the United States Senate Budget Committee, 2000. Available at http://www.cramton.umd.edu/papers2000-2004/00jre-collusive-bidding-lessons.pdf.
[70] P., Cramton. Simultaneous ascending auctions. In P., Cramton, Y., Shoham, and R., Steinberg, editors, Combinatorial Auctions, pages 99–114. Cambridge, MA: MIT Press, 2006.
[71] P., Cramton. Spectrum auction design. Review of Industrial Organization, 42(2):161–190, 2013.
[72] P., Cramton and J. A., Schwartz. Collusive bidding: Lessons from the FCC spectrum auctions. Journal of Regulatory Economics, 17:229–252, 2000.
[73] L., Cricelli, M., Grimaldi, and N. L., Ghiron. The competition among mobile network operators in the telecommunication supply chain. International Journal on Production Economics, 131(1):22–29, 2011.
[74] J., Crowcroft. Net neutrality: The technical side of the debate: A white paper. Computer Communication Review, 37(1):49–56, 2007.
[75] J., Crowcroft, R., Gibbens, F., Kelly, and S., Ostring. Modelling incentives for collaboration in mobile ad hoc networks. In Proceedings of WiOpt '03, 2003.
[76] R., Dai and S.-L., Tang. Interconnection discrimination: A two-sided markets perspective. In Proceedings of Fifth Hot Topics in Networks (HotNets-V '06), 2006.
[77] L. A., DaSilva. Pricing of QoS-enabled networks: A survey. IEEE Communications Surveys & Tutorials, 3(2):2–8, 2000.
[78] H. A., David. Order Statistics. New York: John Wiley, 2nd edition, 1981.
[79] R. W., Day and P., Cramton. The quadratic core-selecting payment rule for combinatorial auctions. Operations Research, 60(3):588–603, 2012.
[80] R. W., Day and P., Milgrom. Core-selecting package auctions. International Journal of Game Theory, 36(3-4):393–407, 2008.
[81] S., de Vries and R., Vohra. Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3):284–309, 2003.
[82] C., Dellarocas and S., Viswanathan. The holy grail of advertising? Allocative efficiency and revenue implications of “pay-per-action” advertising in environments with quality uncertainty. In Proceedings of 4th Workshop on Ad Auctions, Chicago, IL, 2008.
[83] X., Deng and J., Yu. A new ranking scheme of the GSP mechanism with Markovian users. In Workshop on Internet and Network Economics (WINE), 2009.
[84] R., Dewenter and J., Haucap. Incentives to licence mobile virtual network operators (MVNOs). In R., Dewenter and J., Haucap, editors, Access Pricing: Theory and Practice, pages 305–325. Amsterdam: Elsevier Science, 2006.
[85] P., Dolan. Internet Pricing. Is the end of the World Wide Wait in view?Communications & Strategies, 37:15–16, 2000.
[86] L., Duan, J., Huang, and B., Shou. Competition with dynamic spectrum leasing. In Proceedings of Dyspan 2010, Singapore, 2010.
[87] P. K., Dutta. Strategies and Games: Theory and Practice. Cambridge, MA: MIT Press, 1999.
[88] D., Easley and J., Kleinberg. Evolutionary game theory. In Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge: Cambridge University Press, 2010.
[89] R., Edell and P., Varaiya. Providing internet access: What we learn from INDEX. IEEE Network, 13(5):18–25, 1999.
[90] B., Edelman and B., Lockwood. Measuring bias in “organic” web search. http://www.benedelman.org/searchbias/, 2011.
[91] B., Edelman, M., Ostrovsky, and M., Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242–259, 2006.
[92] S., Eidenbenz, G., Resta, and P., Santi. COMMIT: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks. In Proceedings of 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN '05), 2005.
[93] F., Etro. Advertising and search engines. A model of leadership in search advertising. Research in Economics, 67:25–38, 2013.
[94] M., Falkner, M., Devetsikiotis, and I., Lambadaris. An overview of pricing concepts for broadband IP networks. IEEE Communications Surveys & Tutorials, 3(2):2–13, 2000.
[95] A., Farahat and G., Perakis. Profit loss in differentiated oligopolies. Operations Research Letters, 37(1):43–46, 2009.
[96] P., Faratin. Economics of overlay networks: An industrial organization perspective on network economics. In Proceedings of the ACM Conference on Electronic Commerce (EC '07), San Diego, CA, 2007.
[97] Federal Communications Commission. Appropriate Framework for Broadband Access to the Internet over Wireline Facilities. Technical Report FCC 05-151, CC Docket No. 02-33, 2005.
[98] M., Felegyhazi, L., Buttyan, and J.-P., Hubaux. Equilibrium Analysis of Packet Forwarding Strategies in Wireless ad hoc Networks – the Dynamic Case. Technical Report IC/2003/68, Ecole Polytechnique Federale de Lausanne (EPFL), 2003.
[99] M., Felegyhazi, L., Buttyan, and J.-P., Hubaux. Equilibrium analysis of packet forwarding strategies in wireless ad hoc networks – the static case. In Proceedings of the 8th International Conference on Personal Wireless Communications (PWC), 2003.
[100] H., Feng, S., Zhang, C., Liu, J., Yan, and M., Zhang. P2P incentive model on evolutionary game theory. In Proceedings of the 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), pages 1–4, 2008.
[101] K., Fjell. Online advertising: Pay-per-view or pay-per-click-a comment. Journal of Revenue and Pricing Management, 8(2/3):200–206, 2009.
[102] K., Fjell. Online advertising: Pay-per-view versus pay-per-click with market power. Journal of Revenue and Pricing Management, 9(3):198–203, 2010.
[103] R., Frieden. Internet Packet Sniffing and Its Impact on the Network Neutrality Debate and the Balance of Power between Intellectual Property Creators and Consumers. Technical report, SSRN, 2007. http://papers.ssm.com/sol3/papers.cfm?abstract_id=995273.
[104] J., Friedman. A noncooperative equilibrium for supergames. Review of Economic Studies, 38:1–12, 1971.
[105] D., Fudenberg and E., Maskin. The folk theorem in repeated games with discounting or with incomplete information. Econometrica, 54(3):533–554, 1986.
[106] D., Fudenberg and J., Tirole. Dynamic Models of Oligopoly. Newark, NJ: Harwood Academic, 1986.
[107] D., Fudenberg and J., Tirole. Game Theory. Cambridge, MA: MIT Press, 1991.
[108] A., Ganesh, D., Gunawardena, P., Jey, L., Massoulie, and J., Scott. Efficient quarantining of scanning worms: Optimal detection and co-ordination. In Proceedings of IEEE INFOCOM 2006, Barcelona, 2006.
[109] J., Genachowski. Expanding the economic and innovation opportunities of spectrum through incentive auctions. Statement before the Federal Communications Commission, available at http://hraunfoss.fcc.gov/edoc∧public/attachmatch/FCC-12- 118A3.pdf, 2012.
[110] A., Ghosh and A., Sayedi. Expressive auctions for externalities in online advertising. In Workshop on the World Wide Web (WWW), Raleigh, NC, 2010.
[111] A., Gibbard. Manipulation of voting schemes: A general result. Econometrica, 41(4):587–601, 1973.
[112] R. J., Gibbens and F. P., Kelly. Measurement-based connection admission control. In Proceedings of the 15th International Teletraffic Congress, 1997.
[113] R. J., Gibbens and F. P., Kelly. Distributed connection acceptance control for a connectionless network. In Proceedings of the 16th International Teletraffic Congress, 1999.
[114] R. J., Gibbens and F. P., Kelly. Resource pricing and the evolution of congestion control. Automatica, 35:1969–1985, 1999.
[115] R. J., Gibbens, R., Mason, and R., Steinberg. Internet service classes under competition. IEEE Journal on Selected Areas in Communications, 18(12):2490–2498, 2000.
[116] G. T., Gilbert. Positive definite matrices and Sylvester's criterion. The American Mathemat-ical Monthly, 98(1):44–46, 1991.
[117] S., Goel, S., Lahaie, and S., Vassilvitskii. Contract auctions for sponsored search. In Workshop on Internet and Network Economics (WINE), 2009.
[118] J. K., Goeree and Y., Lien. On the Impossibility of Core-Selecting Auctions. IEW Working Paper 452, Institut fuir Volkswirtschaftslehre, Wirtschaftswissenschaftliche Fakultät, Universität Zürich, 2009.
[119] R., Gonen. Characterizing optimal syndicated sponsored search market design. In Proceedings of the 5th Workshop on Ad Auctions, Stanford, CA, 2009.
[120] L. A., Gordon and M. P., Loeb. The economics of information security investment. ACM Transactions on Information System Security, 5(4):438–457, 2002.
[121] N., Gould. An introduction to algorithms for continuous optimization. Oxford University Computing Laboratory Notes, 2006.
[122] J., Green and J.-J., Laffont. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica, 45(2):427–438, 1977.
[123] T., Groves. Incentives in teams. Econometrica, 41(3):617–631, 1973.
[124] V, Guijarro, L., Pla, B., Tuffin, P., Maille, and J. R., Vidal. Competition and bargaining in wireless networks withspectrum leasing. In Proceedings of IEEE GLOBECOM, Houston, TX, 2011.
[125] A., Gupta, D. O., Stahl, and A. B., Whinston. Priority pricing of integrated services networks. In L. W., McKnight and J. P., Bailey, editors, Internet Economics, pages 323–352. Cambridge, MA: MIT Press, 1997.
[126] I., Hafalir, R., Ravi, and A., Sayedi. Sort-cut: A pareto-optimal and semi-truthful mechanism for multi-unit auctions with budget-constrained bidders. In Proceedings of the 5th Workshop on Ad Auctions, Stanford, CA, 2009.
[127] N., Haile and J., Altmann. Value Creation in IT Service Platforms through Two-Sided Network Effects. TEMEP Discussion Papers 201297, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), 2012.
[128] P., Hand, M., Chiang, R., Calderbank, and S., Rangan. Network rate allocation with content provider participation. In Proceedings of IEEEINFOCOM, pages 990–998, Rio de Janeiro, 2009.
[129] G., Hardin. The tragedy of the commons. Science, 162(3859):1243–1248, 1968.
[130] R., Harms and M., Yamartino. The Economics of the Cloud. Technical report, Microsoft Research, 2010.
[131] J. C., Harsanyi. Games with incomplete information played by “Bayesian” players, parts I-III. Management Science, 8:159–182, 320–334, 486–502, 1967-1968.
[132] J. C., Harsanyi. Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points. International Journal of Game Theory, 2:1–23, 1973.
[133] Y., Hayel, D., Ros, and B., Tuffin. Less-than-best-effort services: Pricing and scheduling. In Proceedings of IEEEINFOCOM, Hong Kong 2004.
[134] G., He. A Game-Theoretical Approach to Resource Allocation in Wireless Networks. PhD thesis, Eurecom, 2010.
[135] T., Henderson, J., Crowcroft, and S., Bhatti. Congestion pricing. Paying your way in communication networks. IEEE Internet Computing, 5(5):85–89, 2001.
[136] R. A., Horn and C. R., Johnson. Matrix Analysis. Cambridge: Cambridge University Press, 1985.
[137] K., Hosanagar, R., Krishnan, M., Smith, and J., Chuang. Optimal pricing of content delivery network (CDN) services. In Proceedings of the 37th Annual Hawaii International Conference on System Sciences, page 10, 2004.
[138] D. A., Hyman and D. J., Franklyn. Search Neutrality and Search Bias: An Empirical Perspective on the Impact of Architecture and Labeling. Illinois Program in Law, Behavior and Social Science Paper No. LE13-24; University of San Francisco Law Research Paper No. 2013-15. Available at http://ssrn.com/abstract=2260942, 2013.
[139] INRIA. INRIA's response to ARCEP consultation about network neutrality, 2012.
[140] Interactive Advertising Bureau. IAB internet advertising revenue report, 2008. http://www.iab.net/insightsresearch/530422/1357.
[141] V., Jacobson. Congestion avoidance and control. ACM Computer Communication Review; Proceedings of SIGCOMM '88, 18(4):314–329, 1988.
[142] L., Jiang, V, Anantharam, and J., Walrand. Efficiency of selfish investments in network security. In Proceedings of 3rd Workshop on the Economics of Networks, Systems, and Computation, Seattle, WA, 2008.
[143] R., Johari and J. N., Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29(3):407–435, 2004.
[144] R., Johari, G. Y., Weintraub, and B., Van Roy. Investment and market structure in industries with congestion. Operations Research, 58(5):1303–1317, 2010.
[145] J., Jormakka and J., Molsa. Modelling information warfare as agame. Journal of Information Warfare, 4(2):12–25, 2005.
[146] S., Kakutani. A generalization of Brouwer's fixed point theorem. Duke Mathematical Journal, 8:457–459, 1941.
[147] P., Kalmus and L., Wiethaus. On the competitive effects of mobile virtual network operators. Telecommunications Policy, 34:262–269, 2010.
[148] F. P., Kelly, A. K., Maulloo, and D. K. H., Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237–252, 1998.
[149] F. P., Kelly. Note on effective bandwidths. In F. P., Kelly, S., Zachary, and I. B., Ziedins, editors, Stochastic Networks: Theory and Applications, pages 141–168. Oxford: Oxford University Press, 1996.
[150] F. P., Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33–37, 1997.
[151] F. P., Kelly. Mathematical modelling of the Internet. In Proceedings of the Fourth International Congress on Industrial and Applied Mathematics, 2000.
[152] F. P., Kelly. Models for a self-managed Internet. Philosophical Transactions of the Royal Society, A358:2335–2348, 2000.
[153] D., Kempe and M., Mahdian. A cascade model for externalities in sponsored search. In Workshop on Internet and Network Economics (WINE), pages 585–596, 2008.
[154] S., Keshav. An Engineering Approach to Computer Networking: ATM Networks, the Internet and the Telephone Network. New York: Addison-Wesley, 1999.
[155] H.-S., Kim and C.-H., Yoon. Determinants of subscriber churn and customer loyalty in the Korean mobile telephony market. Telecommunications Policy, 28(9-10):751–765, 2004.
[156] W. A., Kirk and M. A., Khamsi. An Introduction to Metric Spaces and Fixed Point Theory. New York: John Wiley, 2001.
[157] M., Kodialam and T. V., Lakshman. Detecting network intrusions via sampling: A game theoretic approach. In Proceedings of IEEEINFOCOM, 2003.
[158] B., Korte and J., Vygen. Combinatorial Optimization: Theory and Algorithms. Berlin: Springer, 4th edition, 2008.
[159] E., Koutsoupias and C., Papadimitriou. Worst-case equilibria. In Proceedings of 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1999), pages 404–413. Berlin: Springer, 1999.
[160] B., Krebs. I'll take 2 Mastercards and a Visa, please. http://krebsonsecurity.com/2010/09/ill-take-2-mastercards-and-a-visa-please/, 2010.
[161] C. C., Krueger and P. M. C., Swatman. Who are the Internet content providers? Identifying a realistic taxonomy of content providers. In Proceedings of IFIP Conference on e-Business, e-Services, and e-Society (I3E), Sao Paolo, 2003.
[162] J.-J., Laffont, S., Marcus, P., Rey, and J., Tirole. Internet interconnection and the off-net-cost pricing principle. The RAND Journal of Economics, 34:370–390, 2003.
[163] S., Lahaie and D. M, Pennock. Revenue analysis of a family of ranking rules for keyword auctions. In Proceedings of the ACM Conference on Electronic Commerce (EC '07), San Diego, CA 2007.
[164] T., Lan, D., Kao, M., Chiang, and A., Sabharwal. An axiomatic theory of fairness in network resource allocation. In Proceedings of IEEE INFOCOM, 2010.
[165] A. A., Lazar and N., Semret. Design and analysis of the progressive second price auction for network bandwidth sharing. Telecommunication Systems – Special Issue on Network Economics, 20:255–263, 1999.
[166] H., Le Cadre, M., Bouthou, and B., Tuffin. Competition for subscribers between mobile operators sharing a limited resource. In Proceedings of Game Nets, Istanbul, 2009.
[167] H., Le Cadre, M., Bouthou, and B., Tuffin. A pricing model for a mobile network operator sharing limited resource with a mobile virtual network operator. In P., Reichl, B., Stiller, and B., Tuffin, editors, Network Economics for Next Generation Networks. Proceedings of the Sixth International Workshop on Advanced Internet Charging and QoS technologies (ICQT '09). Berlin: Springer, 2009.
[168] T. M., Lenard and R. J., May, editors. Net Neutrality or Net Neutering: Should Broadband Internet Services be Regulated?Berlin: Springer, 2006.
[169] X., Lin and N. B., Shroff. Pricing-based control of large networks. In S., Palazzo, editor, IWDC2001, pages 212–231. Berlin: Springer, 2001.
[170] D., Liu, J., Chen, and A. B., Whinston. Competing keyword auctions. In Proceedings of the 4th Workshop on Ad Auctions, Chicago, IL, 2008.
[171] J., LiuandD. M., Chiu. Mathematical modeling of competition in sponsored searchmarket. In Proceedings of Net Econ, 2010.
[172] P., Liu, W., Zang, and M., Yu. Incentive-based modeling and inference of attacker intent, objectives, and strategies. ACM Transactions on Information and System Security, 8(1):78–118, 2005.
[173] T., Locher, P., Moor, S., Schmid, and R., Wattenhofer. Free riding in Bit Torrent is cheap. In Proceedings of Hot Nets, Irvine, CA, 2006.
[174] R. T. B., Ma, D.-M., Chiu, J. C. S., Lui, V, Misra, and D., Rubenstein. Interconnecting eyeballs to content: A Shapley value perspective on ISP peering and settlement. In Proceedings of the International Workshop on Economics of Networked Systems (NetEcon), pages 61–66, 2008.
[175] R. T. B., Ma, D.-M., Chiu, J. C. S., Lui, V., Misra, and D., Rubenstein. On cooperative settlement between content, transit and eyeball internet service providers. In Proceedings of the ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT), 2008.
[176] R. T. B., Ma, S. C. M., Lee, J. C. S., Lui, and D. K. Y., Yau. An incentive mechanism for P2P networks. In Proceedings of the 24th International Conference on Distributed Computing Systems, pages 516–523, 2004.
[177] J. K., MacKie-Mason and H. R., Varian. Pricing the internet. In B., Kahin and J., Keller, editors, Public Access to the Internet, pages 269–314. Cambridge, MA: MIT Press, 1995.
[178] M., Mahdian, S. M., Li, and R. P., McAfee. Value of learning in sponsored search auctions. In Workshop on Internet and Network Economics (WINE), Stanford, CA, 2010.
[179] P., Maille. Auctioning for downlink transmission power in CDMA cellular systems. In Proceedings of 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), Venice, 2004.
[180] P., Maille, E., Markakis, M., Naldi, G., Stamoulis, and B., Tuffin. Sponsored search auctions: An overview of research with emphasis on game theoretic aspects. Electronic Commerce Research, 12:265–300, 2012.
[181] P., Maille, M., Naldi, and B., Tuffin. Price war with migrating customers. In Proceedings of 17th IEEE International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2009), London, 2009.
[182] P., Maille, P., Reichl, and B., Tuffin. Of threats and costs: A game-theoretic approach to security risk management. In N., Gulpinar, P., Harrison, and B., Rüstem, editors, Performance Models and Risk Management in Communication Systems. Berlin: Springer, 2010.
[183] P., Maille, P., Reichl, and B., Tuffin. Interplay between security providers, consumers, and attackers: A weighted congestion game approach. In Proceedings of the 2nd Conference on Decision and Game Theory for Security (GameSec 2011), College Park, MD, 2011.
[184] P., Maille and B., Tuffin. Multi-bid auctions for bandwidth allocation in communication networks. In Proceedings of IEEE INFOCOM, 2004.
[185] P., Maille and B., Tuffin. Multi-bid versus progressive second price auctions in a stochastic environment. In Proceedings of ICQT '04, LNCS 3266, pages 318–327, Barcelona, Berlin: Springer, 2004.
[186] P., Maille and B., Tuffin. Pricing the internet with multibid auctions. IEEE/ACM Transactions on Networking, 14(5):992–1004, 2006.
[187] P., Maille and B., Tuffin. Why VCG auctions can hardly be applied to the pricing of interdomain and ad hoc networks. In Proceedings of3rd Euro NGI Conference on Next Generation Internet Networks, pages 36–39, Trondheim, 2007.
[188] P., Maille and B., Tuffin. Price war with partial spectrum sharing for competitive wireless service providers. In Proceedings of IEEE GLOBECOM, Honolulu, HI, 2009.
[189] P., Maille and B., Tuffin. On the interest of introducing randomness in ad-word auctions. In Proceedings of the 1st IFIP International Conference on the Network of the Future, Brisbane, 2010.
[190] P., Maille and B., Tuffin. Price war in heterogeneous wireless networks. Computer Networks, 54(13):2281–2292, 2010.
[191] P., Maille and B., Tuffin. Adword auction bidding strategies of budget-limited advertisers on competing search engines. In Proceedings of the 7th International Conference on Network and Service Management (CNSM 2011), Paris, 2011.
[192] P., Maille and B., Tuffin. On the ranking strategy in adword auctions. In Proceedings of the 8th International Conference on Information Technology: New Generations (ITNG), Las Vegas, CA, 2011.
[193] P., Maille and B., Tuffin. Sponsored search engines in competition: Advertisers behavior and engines optimal ranking strategies. In Proceedings of the 19th Annual Meeting of the IEEE/ACM International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2011), 2011.
[194] P., Maille and B., Tuffin. Competition among providers in loss networks. Annals of Operations Research, Special Volume on Operations Research and Systems (ALIO-INFORMS), 199:3–22, 2012.
[195] P., Maille, B., Tuffin, and J.-M., Vigne. Technological investment games among wireless telecommunications service providers. International Journal on Network Management -Special Issue: Economic Traffic Management, 21(1):65–82, 2011.
[196] P., Maille, M., Naldi, and B., Tuffin. Competition for migrating customers: A game-theoretic analysis in a regulated regime. In Proceedings of IEEE GLOBECOM, New Orleans, LA, 2008.
[197] M., Mandjes. Pricing strategies under heterogeneous service requirements. In IEEE INFOCOM, 2003.
[198] A., Mangani. Online advertising: Pay-per-view versus pay-per-click. Journal of Revenue and Pricing Management, 2:295–302, 2004.
[199] M. H., Manshaei, J., Freudiger, M., Felegyhazi, P., Marbach, and J.-P., Hubaux. On wireless social community networks. In Proceedings of IEEE INFOCOM, Phoenix, AZ, 2008.
[200] M. H., Manshaei, P., Marbach, and J.-P., Hubaux. Evolution and market share of wireless community networks. In Proceedings of IEEE International Conference on Game Theory for Networks (GameNets), Istanbul, 2009.
[201] P., Marbach. Pricing differentiated services networks: Bursty traffic. In Proceedings of IEEE INFOCOM2001, 2001.
[202] P., Marbach. Priority service and max-min fairness. In Proceedings of IEEE INFOCOM, 2002.
[203] P., Marbach. Analysis of a static pricing scheme for priority services. IEEE/ACM Transactions on Networking, 12(2):312–325, 2004.
[204] P., Marbach and R., Berry. Downlink resource allocation and pricing for wireless networks. In Proceedings of IEEE INFOCOM, 2002.
[205] S., Marti, T. J., Giuli, K., Lai, and M., Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the Sixth ACM/IEEE International Conference on Mobile Computing and Networking, pages 255–265, 2000.
[206] J. Maynard, Smith and G. R., Price. The logic of animal conflict. Nature, 246(5427):15–18, 1973.
[207] D., McAdams. Multiproduct Monopoly Bundling. Technical report, Graduate School of Business, Stanford University, 1999.
[208] R. P., McAfee and J., McMillan. Auctions and bidding. Journal of Economic Literature, 25(2):699–738, 1987.
[209] R. P., McAfee, J., McMillan, and M. D., Whinston. Multiproduct monopoly, commodity bundling, and correlation of values. The Quarterly Journal of Economics, 114:371–383, 1989.
[210] J. K., MacKie-Mason and H. R., Varian. Some Economics of the Internet. Technical report, University of Michigan, November 1993. http://wueconb.wustl.edu:8089/eps/comp/papers:9401/9401001.pdf.
[211] J. K., MacKie-MasonandH. R., Varian. Pricingcongestible networkresources. IEEE Journal on Selected Areas in Communications, 13:1141–1149, 1995.
[212] L., McKnight, R., Solomon, J., Reagleet al.Information security for internet commerce. In L. W., McKnight and J. P., Bailey, editors, Internet Economics, pages 435–452. Cambridge, MA: MIT Press, 1997.
[213] I., Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13(1):111–124, 1996.
[214] I., Milchtaich. Weighted congestion games with separable preferences. Games and Economic Behavior, 67(2):750–757, 2009.
[215] P., Milgrom. Putting auction theory to work: The simultaneous ascending auction. Journal of Political Economy, 108(2):245–272, 2000.
[216] P., Milgrom. Putting Auction Theory to Work. Cambridge: Cambridge University Press, 2004.
[217] J., Mo, W., Kim, and D., Lee. Impacts of universal service regulation for broadband internet services. In J., Cohen, P., Maille, and B., Stiller, editors, Economics of Converged, Internet-Based Networks, pages 14–25. Berlin: Springer, 2011.
[218] J., Mo and J., Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5):556–567, 2000.
[219] D., Monderer and L. S., Shapley. Fictitious play property for games with identical interests. Journal of Economic Theory, 68:258–265, 1996.
[220] D., MondererandL. S., Shapley. Potential games. Games and Economic Behaviour, 14:124–143, 1996.
[221] I., Mundell. Piracy in Europe costs $13.7 billion. Variety, March 2010. http://www.variety.com/article/VR1118016618/?categoryId=1338&cs=1.
[222] J., Musacchio, J., Walrand, and G., Schwartz. Network neutrality and provider investment incentives. In Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, 2007. ACSSC2007, pages 1437–1444, 2007.
[223] S., Muthukrishnan, M., Pal, and Z., Svitkina. Stochastic models for budget optimization in search-based advertising. In Workshop on Internet and Network Economics (WINE), pages 131–142, 2007.
[224] H., Mutlu, M., Alanyali, and D., Starobinski. Spot pricing of secondary spectrum usage in wireless cellular networks. In Proceedings of IEEE INFOCO, pages 682–690, Phoenix, AZ, 2008.
[225] R. B., Myerson. Incentive compatibility and the bargaining problem. Econometrica, 47(1):61–74, 1979.
[226] R. B., Myerson. Optimal auction design. Athematics of Operations Research, 6(1):58–73, 1981.
[227] P., Nabipay, A., Odlyzko, and Z. L., Zhang. Flat versus metered rates, bundling, and bandwidth hogs. In Proceedings of Net Econ 11: 6th Workshop on the Economics of Networks, Systems, and Computation, 2011.
[228] A., Nagurney. Supply Chain Network Economics: Dynamics of Prices, Flows and Profits. Cheltenham: Edward Elgar Publishing, 2006.
[229] M., Naldi. A simple model for the effectiveness of delaying strategies for telecommunications churn reduction. In Proceedings of 10th International Conference on Computer Modelling and Simulation (EUROSIM), Cambridge, 2008.
[230] J., Nash. Two-person cooperative games. Econometrica: Journal of the Econometric Society, 21(1):128–140, 1953.
[231] J. F., Nash. Equilibrium points in n-person games. In Proceedings of the NAS, 36:48–49, 1950.
[232] N., Nisan, T., Roughgarden, E., Tardos, and V., Vazirani, editors. Algorithmic Game Theory. Cambridge: Cambridge University Press, 2007.
[233] P., Njoroge, A., Ozdaglar, N., Stier-Moses, and G., Weintraub. Investment in Two Sided Markets and the Net Neutrality Debate. Technical Report DRO-2010-05, Columbia University, Decision, Risk and Operations Working Papers Series, 2010.
[234] J. R., Norris. Markov Chains. Cambridge: Cambridge University Press, 1998.
[235] F., Oberholzer and K., Strumpf. The effect of file sharing on record sales: An empirical analysis. Journal of Political Economy, 1(115):1–42, 2007.
[236] A., Odlyzko. Paris Metro pricing for the Internet. In ACM Conference on Electronic Commerce (EC '99), pages 140–147, 1999.
[237] A., Odlyzko. Content Is Not King. Technical report, AT&T Labs, 2000.
[238] A., Odlyzko. The History of Communications and Its Implications for the Internet. Technical report, AT&T Labs, 2000.
[239] A., Odlyzko. The Internet and Past and Future Communications Revolutions. Technical report, School of Mathematics, University of Minnesota, 2009.
[240] A., Odlyzko. Network neutrality, search neutrality, and the never-ending conflict between efficiency and fairness in markets. Review of Network Economics, 8(1):40–60, 2009.
[241] A., Odlyzko, B. St., Arnaud, E., Stallman, and M., Weinberg. Know Your Limits: Considering the Role of Data Caps and Usage Based Billing in Internet Access Service. Technical report, Public Knowledge, May 2012.
[242] BEUC The European Consumer's Organization. Fair internet search – remedies in Google case. Position paper, available from www.beuc.org, 2013.
[243] M. J., Osborne and A., Rubinstein. A Course in Game Theory. Cambridge, MA: MIT Press, 1994.
[244] D. C., Parkes. Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency. PhD thesis, University of Pennsylvania, 2001.
[245] I. Ch., Paschalidis and Y., Liu. Pricing in multiservice loss networks: Static pricing, asymptotic optimality, and demand substitution effects. IEEE/ACM Transactions on Networking, 10(3):425–438, 2002.
[246] I. Ch., Paschalidis and J. N., Tsitsiklis. Congestion-dependent pricing of network services. IEEE/ACM Transactions on Networking, 8(2):171–184, 2000.
[247] A., Patcha and J.-M., Park. A game theoretic formulation for intrusion detection in mobile ad hoc networks. International Journal of Network Security, 2(2):131–137, 2006.
[248] G., Perakis. The “Price of Anarchy” under nonlinear and asymmetric costs. Mathematics of Operations Research, 32(3):614–628, 2007.
[249] A. C., Pigou. The Economics of Welfare. London: Macmillan, 1920.
[250] D., Porter, S., Rassenti, A., Roopnarine, and V., Smith. Combinatorial auction design. Proceedings of the NAS, 100(19):11153–11157, 2003.
[251] M. E., Porter. What is strategy?Harvard Business Review, November-December:61–78, 1996.
[252] J., Qi, Y., Zhang, Y., Zhang, and S., Shi. Treelogit model for customer churn prediction. In Proceedings of IEEE Asia-Pacific Conference on Services Computing, pages 70–75, Washington, DC, 2006.
[253] P., Reichl, R., Schatz, and B., Tuffin. Logarithmic laws in service quality perception: Where microeconomics meets psychophysics and quality of experience. Telecommunication Systems, 48(1-2):1–14, 2011.
[254] P., Reichl and B., Stiller. Nil nove sub sole: Why internet charging schemes look like as they do. In Proceedings of the 4th Berlin Internet Economic Workshop, 2001.
[255] J., Riley and W., Samuelson. Optimal auctions. The American Economic Review, 71(3):381–392, 1981.
[256] J. W., Roberts. Quality of service guarantees and charging in multiservice networks. IEICE Transactions on Communication, E81(5):824–831, 1998.
[257] D., Ros and B., Tuffin. A mathematical model of the Paris Metro pricing scheme for charging packet networks. Computer Networks, 46(1):73–85, 2004.
[258] E., Rosen, A., Viswanathan, and R., Callon. Multiprotocol Label Switching Architecture. IETF report RFC 3031, 2001.
[259] R. W., Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2(1):65–67, 1973.
[260] T., Roughgarden. The price of anarchy is independent of the network topology. Journal of Computer and System Sciences, 67:341–364, 2003.
[261] A., Rubinstein. Equilibrium in supergames with the overtaking criterion. Journal of Economic Theory, 21:1–9, 1979.
[262] W., Rudin. Functional Analysis. New York: McGraw-Hill, 2nd edition, 1991.
[263] W. H., Sandholm. Potential games with continuous player sets. Journal of Economic Theory, 97(1):81–108, 2001.
[264] W. H., Sandholm. Evolutionary game theory. In R. A., Meyers, editor, Encyclopedia of Complexity and Systems Science, pages 3176–3205. Berlin: Springer, 2009.
[265] W. H., Sandholm. Large population potential games. Journal of Economic Theory, 144(4):1710–1725, 2009.
[266] W. H., Sandholm. Population Games and Evolutionary Dynamics. Cambridge, MA: MIT Press, 2010.
[267] C. U., Saraydar, N. B., Mandayam, and D. J., Goodman. Pricing and power control in a multicell wireless data network. IEEE JSAC Wireless Series, 19(2):277–286, 2001.
[268] C. U., Saraydar, N. B., Mandayam, and D. J., Goodman. Efficient power control via pricing in wireless data networks. IEEE Transactions on Communications, 50(2):291–303, 2002.
[269] P. S., Sastry, V. V., Phansalkar, and M. A. L., Thathachar. Decentralized learning of Nash equiibria in multi-person stochastic games with incomplete information. IEEE Transactions on Systems, Man, and Cybernetics, 24:769–777, 1994.
[270] M. J., Scott. Network Operators and Content Providers: Who Bears the Cost? Technical report 201297, SSRN, 2011.
[271] N., Semret. Market Mechanisms for Network Resource Sharing. PhD thesis, Columbia University, 1999.
[272] N., Semret, R., Liao, A., Campbell, and A., Lazar. Market Pricing of Differentiated Internet Services. Technical report CU/CTR/TR 503-98-37, Columbia University, 1998.
[273] N., Semret, R. R.-F., Liao, A. T., Campbell, and A. A., Lazar. Pricing, provisioning and peering: Dynamic markets for differentiated internet services and implications for network interconnections. IEEE Journalon Selected Areas in Communications, 18(12):2499–2513, 2000.
[274] S., Sengupta and M., Chatterjee. An economic framework for dynamic spectrum access and service pricing. IEEE/ACM Transactions on Networking, 17(4):1200–1213, 2009.
[275] D. H., Shin and M., Bartolacci. A study of MVNO diffusion and market structure in the EU, US, Hong Kong, and Singapore. Telematics and Informatics, 24:86–100, 2007.
[276] G., Singh, C., Kesselman, and E., Deelman. Adaptive pricing for resource reservations in shared environments. In Proceedings of the 8th IEEE/ACM International Conference on Grid Computing, GRID '07, pages 74–80, Washington, DC, 2007.
[277] V. A., Siris. Resource control for elastic traffic in CDMA networks. In Proceedings of the 8th International Conference on Mobile Computing and Networking, pages 193–204, Atlanta, GA, 2002.
[278] V A., Siris and C., Courcoubetis. Resource control for loss-sensitive traffic in CDMA networks. In Proceedings of IEEE INFOCOM 2004, Hong Kong, 2004.
[279] D. J., Songhurst, editor. Charging Communication Networks. Amsterdam: Elsevier, 1999.
[280] B., Stiller, P., Reichl, and S., Leinen. Pricing and cost recovery for Internet services: Practical review, classification, and application of relevant models. Netnomics, 3(2):149–171, 2001.
[281] J., Sun, E., Modiano, and L., Zheng. A novel auction algorithm for fair allocation of a wireless fading channel. In Proceedings of 38th Annual Conference on Information Science and Systems, Princeton, NJ, 2004.
[282] J., Sun, L., Zheng, and E., Modiano. Wireless channel allocation using an auction algorithm. In Proceedings of Allerton Conference on Communications, Control and Computing, 2003.
[283] K., Sydsaeter and P., Hammond. Essential athematics for Economic Analysis. Harlow: Prentice Hall, 3rd edition, 2008.
[284] Symantec. State of Enterprise Security. http://www.symantec.com/content/en/us/about/presskits/SES_report_Feb2010.pdf, 2010.
[285] K. T., Talluri and G. J., van Ryzin. The Theory and Practice of Revenue Management. Boston, MA: Kluwer, 2004.
[286] H. Tran, Hoang and B., Tuffin. Inter-domain pricing: Challenges and possible approaches. International Journal of Network Management, 21(3):223–246, 2011.
[287] K. S., Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications. New York: John Wiley & Sons, 2nd edition, 2002.
[288] B., Tuffin. Charging the Internet without bandwidth reservation: An overview and bibliography of mathematical approaches. Journal of Information Science and Engineering, 19(5):765–786, 2003.
[289] H. R., Varian. Position auctions. International Journal of Industrial Organization, 25:1163–1178, 2005.
[290] W., Vickrey. Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16(1):8–37, 1961.
[291] A. J., Viterbi. CDMA. Principles of Spread Spectrum Communication. New York: Addison-Wesley, 1995.
[292] X., Vives. Oligopoly Pricing. Cambridge, MA: MIT Press, 1990.
[293] H., von Stackelberg. Market Structure and Equilibrium. Berlin: Springer, 2010. Translation by D., Bazin, R., Hill, and L., Urch.
[294] E., Walker, W., Brisken, and J., Romney. To lease or not to lease from storage clouds. Computer, 43(4):44–50, 2010.
[295] J., Walrand and P., Varaiya. High-Performance Communication Networks. New York: Morgan Kaufmann Publishers, 2nd edition, 2000.
[296] G. R., Walsh. Methods of Optimization. New York: John Wiley & Sons, 1975.
[297] J. G., Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers, 1:325–378, 1952.
[298] D., Waterman and S., Choi. Non-discrimination rules for ISPs and vertical integration: Lessons from cable television. Telecommunications Policy, 35(11):970–983, 2011.
[299] D., Waterman, R., Sherman, and S. W., Ji. Television: Revenue models, aggregation, and “TV everywhere.” In Research Conference on Communication, Information and Internet Policy (TPRC), 2012.
[300] C., Watkins and P., Dayan. Q-learning. Machine Learning, 8:279–292, 1992.
[301] K., Wieland. The customer retention challenge. Telecommunications, 40(10):14–17, 2006.
[302] L. A., Wolsey. Integer Programming. New York: John Wiley & Sons, 1998.
[303] S., Wong, J., Rojas-Mora, and E., Altman. Public Consultations on Net Neutrality 2010: USA, EU and France. Technical report, SSRN, 2010. http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1684086.
[304] J. D., Wright. Defining and Measuring Search Bias: Some Preliminary Evidence. Fairfax, VA: George Mason University School of Law, 2012.
[305] S., Yang and B., Hajek. VCG-Kelly mechanisms for allocation of divisible goods: Adapting VCG mechanisms to one-dimensional signals. IEEE Journal on Selected Areas in Communications, 25(6):1237–1243, 2007.
[306] C. S., Yoo. Vertical integration and media regulation in the new economy. Yale Journal on Regulation, 19(1):171–300, 2002.
[307] S., Zamir. Bayesian games: Games with incomplete information. In R. A., Meyers, editor, Encyclopedia of Complexity and Systems Science, pages 426–441. Berlin: Springer, 2009.
[308] T., Zeller. Black market in stolen credit card data thrives on Internet. The New York Times, June 21, 2005.
[309] L., Zhang, S., Deering, D., Estrin, S., Shenker, and D., Zappala. RSVP: A new resource reservation protocol. IEEE Network, 7(9):8–18, 1993.
[310] B. Q., Zhao, J. C. S., Lui, and D.-M., Chiu. Mathematical modeling of incentive policies in P2P systems. In Proceedings of the 3rd International Workshop on Economics of Networked Systems, NetEcon '08, pages 97–102, New York, 2008.
[311] S., Zhong, J., Chen, and Y. R., Yang. Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In Proceedings of IEEE INFOCOM, 2003.
