Aczél, J. 1966. Lectures on Functional Equations and Their Applications. New York: Academic Press.Google Scholar

Adamo, Tim, and Matros, Alexander. 2009. A Blotto game with incomplete information. Economics Letters, 105(1), 100–102.CrossRefGoogle Scholar

Adler, B. Thomas, de Alfaro, Luca, Pye|Ian, and Raman, Vishwanath. 2008. Measuring author contributions to theWikipedia. Pages 1–15 of: Proceedings of the 4th International Symposium on Wikis. WikiSym ’08. New York: ACM.Google Scholar

Agastya, Murali, and McAfee, R. Preston. 2006. Continuing Wars of Attrition. Working Papers.

Agresti, Alan. 2013. Categorical Data Analysis. 3 edn. New York: John Wiley & Sons.Google Scholar

Ailon, Nir. 2007. Aggregation of partial rankings, p-ratings and top-m lists. Pages 415–424 of: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’07. Philadelphia: Society for Industrial and Applied Mathematics.Google Scholar

Ailon, Nir, and Mohri, Mehryar. 2008. An efficient reduction of ranking to classification. Pages 87–98 of: Servedio, Rocco A., and Zhang, Tong (eds), COLT. Lecture Notes in Computer Science. Madison, WI: Omnipress.Google Scholar

Ailon, Nir, Charikar, Moses, and Newman, Alantha. 2008. Aggregating inconsistent information: Ranking and clustering. Journal of the ACM, 55(5), 23:1–23:27.CrossRefGoogle Scholar

Albrecht, James, Gautier, Pieter, and Vroman, Susan. 2012. A note on Peters and Severinov: Competition among sellers who offer auctions instead of prices. Journal of Economic Theory, 147(1), 389–392.CrossRefGoogle Scholar

Allard, Richard J. 1988. Rent-seeking with non-identical players. Public Choice, 57(1), 3–14.Google Scholar

Alon, Noga. 2006. Ranking tournaments. SIAM Journal on Discrete Mathematics, 20(1), 137–142.CrossRefGoogle Scholar

Altman, A., and Tennenholtz, M. 2008. Axiomatic foundations for ranking systems. Journal of Artificial Intelligence Research, 31, 473–495.Google Scholar

Altman, Alon, and Kleinberg, Robert. 2010. Pages 686–690: Proceedings of the 24th AAAI Conference on Artificial Intelligence, Atlanta. Nonmanipulable randomized tournament selections. Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10).

Altman, Alon, Procaccia, Ariel D., and Tennenholtz, Moshe. 2009. Nonmanipulable selections from a tournament. Pages 27–32 of: Proceedings of the 21st International Joint conference on Artifical Intelligence. IJCAI'09. San Francisco: Morgan Kaufmann Publishers Inc.Google Scholar

Amann, E., and Leininger, W. 1996. Asymmetric all-pay auctions with incomplete information: The two-player case. Games and Economic Behavior, 14(1), 1–18.CrossRefGoogle Scholar

Amann, Erwin, and Qiao, Heng. 2008. Parallel Contests. TWI Research Paper Series 36. Thurgauer Wirtschaftsinstitut, Universitt Konstanz.

Amegashie, J. Atsu. 2006. A contest success function with a tractable noise parameter. Public Choice, 126, 135–144.CrossRefGoogle Scholar

Amir, Rabah. 1996. Cournot oligopoly and the theory of supermodular games. Games and Economic Behavior, 15(2), 132–148.CrossRefGoogle Scholar

Andelman, Nir, Feldman, Michal, and Mansour, Yishay. 2009. Strong price of anarchy. Games and Economic Behavior, 65(2), 289–317.CrossRefGoogle Scholar

Andersen, Reid, Borgs, Christian, Chayes, Jennifer, Feige, Uriel, Flaxman, Abraham, Kalai, Adam, Mirrokni, Vahab, and Tennenholtz, Moshe. 2008. Trust-based recommendation systems: An axiomatic approach. Pages 199–208 of: Proceedings of the 17th International Conference on World Wide Web. WWW ’08. New York: ACM.Google Scholar

Anderson, Simon P., and Renault, Regis. 2003. Efficiency and surplus bounds in Cournot competition. Journal of Economic Theory, 113(2), 253–264.CrossRefGoogle Scholar

Anderson, Simon P., Goeree Jacob, K., and Holt Charles, A. 1998. The war of attrition with noisy players. Pages 15–29 of: in Advances in Applied Microeconomics, Volume 7. Bingley, UK: JAI Press.Google Scholar

Anderson, Simon P., Goeree, Jacob K., and Holt, Charles A. 2001. Minimum-effort coordination games: Stochastic potential and logit equilibrium. Games and Economic Behavior, 34(2), 177–199.CrossRefGoogle Scholar

Annis, David H., and Wu, Samuel S. 2006. A comparison of potential playoff systems for NCAA I-A football. The American Statistician, 60, 151–157.CrossRefGoogle Scholar

Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., and Roughgarden, T. 2004. The price of stability of network design with fair cost allocation. Pages 295–304 of: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. FOCS'04.

Anshelevich, Elliot, and Hoefer, Martin. 2012. Contribution games in networks. Algorithmica, 63(1–2), 51–90.CrossRefGoogle Scholar

Anwar, Sajid, McMillan, Robert, and Zheng, Mingli. 2006. Bidding behavior in competing auctions: Evidence from eBay. European Economic Review, 50(2), 307–322.CrossRefGoogle Scholar

Aoyagi, M. 2010. Information feedback in a dynamic tournament. Games and Economic Behavior, 70, 242–260.CrossRefGoogle Scholar

Appelbaum, Elie, and Katz, Eliakim. 1986. Transfer seeking and avoidance: On the full social costs of rent seeking. Public Choice, 48(2), 175–181.CrossRefGoogle Scholar

Appleton, David R. 1995. May the best man win? The Statistician, 44, 529–538.CrossRefGoogle Scholar

Archak, Nikolay. 2010. Money, glory and cheap talk: analyzing strategic behavior of contestants in simultaneous crowdsourcing contests on TopCoder.com. Pages 21–30 of: Proceedings of the 19th international conference on World wide web. WWW ’10. New York: ACM.Google Scholar

Archak, Nikolay, and Sundararajan, Arun. 2009. Optimal design of crowdsourcing contests. In: Proc. of International Conference on Information Systems.

Arnold, Barry C., Balakrishnan, N., and Nagaraja, H. N. 2008. A First Course in Order Statistics. SIAM Classics in Applied Mathematics.CrossRefGoogle Scholar

Arrow, K. J., Chenery, H. B., Minhas, B. S., and Solow, R. M. 1961. Capital-labor substitution and economic efficiency. Review of Economics and Statistics (The MIT Press), 43(3), 225–250.Google Scholar

Arrow, Kenneth J. 1951. Social Choice and Individual Values. Yale University Press.Google Scholar

Ashenfelter, O. 1998. How auctions work for wine and art. Journal of Economic Perspectives, 3(3), 23–36.Google Scholar

Ashlagi|Itai, Edelman|Benjamin, and Lee|Hoan Soo. 2010. Competing Ad Auctions: Multi-Homing and Participation Costs. Working Papers 10-055. Harward Business School.

Ashlagi, Itai, Monderer, Dov, and Tennenholtz, Moshe. 2011. Simultaneous ad auctions. Mathematics of Operations Research, 36(1), 1–13.CrossRefGoogle Scholar

Atlamaz, Murat, Berden, Caroline, Peters, Hans, and Vermeulen, Dries. 2011. Non-cooperative solutions for estate division problems. Games and Economic Behavior, 73(1), 39–51.CrossRefGoogle Scholar

Augenblick, Ned. 2011. Consumer and Producer Behavior in the Market for Penny Auctions: A Theoretical and Empirical Analysis. Working Papers.

Aumann, Robert J. 1974. Subjectivity and correlation in randomized strategies. Journal of Mathematical Economics, 1(1), 67–96.CrossRefGoogle Scholar

Auriol, Emmanuelle, and Renault, Regis. 2008. Status and incentives. RAND Journal of Economics, 39(1), 305–326.CrossRefGoogle Scholar

Azar, Yossi, Birnbaum, Benjamin, Celis, L. Elisa, Devanur, Nikhil R., and Peres, Yuval. 2009. Convergence of local dynamics to balanced outcomes in exchange networks. Pages 293–302 of: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science. FOCS ’09. Washington, DC: IEEE Computer Society.Google Scholar

Azmat, Ghazala, and Möller, Marc. 2009. Competition among contests. RAND Journal of Economics, 40(4), 743–768.CrossRefGoogle Scholar

Bachrach, Yoram, Syrgkanis, Vasilis, Tardos, Éva, and Vojnović, Milan. 2014. Strong price of anarchy, utility games and coalitional dynamics. Pages 218–230 of: Proceedings of the 7th International Symposium on Algorithmic Game Theory. SAGT 2014, Haifa, Israel.

Bachrach, Yoram, Syrgkanis, Vasilis, and Vojnović, Milan. 2013. Incentives and efficiency in uncertain collaborative environments. Pages 26–39 of: Proceedings of the 9th Conference on Web and Internet Economics. WINE 2013, Cambridge, MA.Google Scholar

Bag, Parimal Kanti, and Sabourian, Hamid. 2005. Distributing awards efficiently: More on King Solomon's problem. Games and Economic Behavior, 53(1), 43–58.CrossRefGoogle Scholar

Baik, Kyung Hwan. 1993. Effort levels in contests: The public-good prize case. Economics Letters, 41(4), 363–367.CrossRefGoogle Scholar

Baik, Kyung Hwan. 1994. Effort levels in contests with asymmetric players. Southern Economic Journal, 61, 367–378.CrossRefGoogle Scholar

Baik, Kyung Hwan. 1998. Difference-form contest success functions and effort levels in contests. European Journal of Political Economy, 14(4), 685–701.CrossRefGoogle Scholar

Baik, Kyung H., and Jason, F. 1992. Strategic behavior in contests:Comment. The American Economic Review, 82(1), 359–362.Google Scholar

Bala, Venkatesh, and Goyal, Sanjeev. 2000. A noncooperative model of network formation. Econometrica, 68(5), 1181–1229.CrossRefGoogle Scholar

Ballester, Coralio, Calvó-Armengol, Antoni, and Zenou, Yves. 2006. Who'swho in networks.Wanted: The key player. Econometrica, 74(5), 1403–1417.CrossRefGoogle Scholar

Bapna, Ravi, Dellarocas, Chrysanthos, and Rice, Sarah. 2010. Vertically differentiated simultaneous Vickrey auctions: Theory and experimental evidence. Management Science, 56(7), 1074–1092.CrossRefGoogle Scholar

Barclays Premier, League. 2014. The Official Website of the Barclays Premier League. http://www.premierleague.com

Bartholdi, J., III, Tovey, C. A., and Trick, M. A. 1989. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6(2), 157–165.CrossRefGoogle Scholar

Barut, Yasar, and Kovenock, Dan. 1998. The symmetric multiple prize all-pay auction with complete information. European Journal of Political Economy, 14(4), 627–644.CrossRefGoogle Scholar

Bassett, G. W. 1997. Robust sports ratings based on least absolute errors. The American Statistician, 51(2), 99–105.Google Scholar

Bateni, MohammadHossein, Hajiaghayi, MohammadTaghi, Immorlica, Nicole, and Mahini, Hamid. 2010. The cooperative game theory foundations of network bargaining games. Pages 67–78 of: Proceedings of 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, Bordeaux, France.

Baye, Michael R., Kovenock, Dan, and de Vries, Casper G. 1993. Rigging the lobbying process: An application of the all-pay auction. American Economic Review, 83(1), 289–294.Google Scholar

Baye, Michael R., Kovenock, Dan, and de Vries, Casper G. 1994. The solution to the Tullock rentseeking game when R > 2: Mixed-strategy equilibria and mean dissipation rates. Public Choice, 81(3–4), 363–380.CrossRefGoogle Scholar

Baye, Michael R., Kovenock, Dan, and de Vries, Casper G. 1996. The all-pay auction with complete information. Economic Theory, 8(2), 291–305.CrossRefGoogle Scholar

Baye, Michael R., Kovenock, Dan, and de Vries, Casper G. 1999. The incidence of overdissipation in rent-seeking contests. Public Choice, 99(3/4), 439–454.CrossRefGoogle Scholar

Beasley, John D. 2006. The Mathematics of Games. New York: Dover.Google Scholar

Beenen, Gerard, Ling, Kimberly, Wang, Xiaoqing, Chang, Klarissa, Frankowski, Dan, Resnick, Paul, and Kraut, Robert E. 2004. Using social psychology to motivate contributions to online communities. Pages 212–221 of: Proceedings of the 2004 ACMConference on Computer Supported Cooperative Work. CSCW ’04. New York: ACM.Google Scholar

Bellman, R. 1969. On Colonel Blotto and analogous games. SIAM Review, 11(1), 66–68.CrossRefGoogle Scholar

Bennett, George. 1962. Probability Inequalities for the Sum of Independent Random Variables. Journal of the American Statistical Association, 57(297), pp. 33–45.CrossRefGoogle Scholar

Berend, Daniel, Chernyavsky, Yuri, and Sapir, Luba. 2008. Ranking of Weighted Majority Rules. Journal of Applied Probability, 45(4), 994–1006.CrossRefGoogle Scholar

Berend, Daniel, and Sapir, Luba. 2003. Between the expert and majority rules. Advances in Applied Probability, 35(4), 941–960.CrossRefGoogle Scholar

Berry, Randall A., and Johari, Ramesh. 2013. Economic modeling in networking: A primer. Foundations and Trends in Networking, 6(3), 165–286.Google Scholar

Bernstein, S. 1927. Theory of Probability. Moscow.Google Scholar

Bertoletti, Paolo. 2006 (Jan.). On the reserve price in all-pay auctions with complete information and lobbying games. MPRA Paper 1083. University Library of Munich, Germany.Google Scholar

Beygelzimer, Alina, Langford, John, and Ravikumar, Pradeep. 2009. Error-correcting tournaments. Pages 247–262 of: Proceedings of the 20th International Conference on Algorithmic Learning Theory. ALT'09. Berlin: Springer-Verlag.Google Scholar

Bhaskar, Umang, Fleischer, Lisa, Hoy, Darrell, and Huang, Chien-Chung. 2009. Equilibria of atomic flow games are not unique. Pages 748–757 of: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’09. Philadelphia: Society for Industrial and Applied Mathematics.Google Scholar

Bhattacharya, S., Goel, G., Gollapudi, S., and Munagala, K. 2010. Budget constrained auctions with heterogeneous items. Pages 379–388 of: Proceedings of the 42nd ACM Symposium on Theory of Computing, Cambridge, MA.Google Scholar

Bikhchandani, Sushil. 1999. Auctions of heterogeneous objects. Games and Economic Behavior, 26(2), 193–220.CrossRefGoogle Scholar

Bishop, Christopher M. 2006. Pattern Recognition and Machine Learning. New York: Springer.Google Scholar

Bishop, D. T., and Cannings, C. 1978. A generalized war of attrition. Journal of Theoretical Biology, 70(1), 85–124.CrossRefGoogle ScholarPubMed

Bishop, D. T., Cannings, C., and Smith, J. Maynard. 1978. The war of attrition with random rewards. Journal of Theoretical Biology, 74(3), 377–388.CrossRefGoogle ScholarPubMed

Blackett, D. W. 1954. Some Blotto games. Naval Research Logistics Quarterly, 1(1), 55–60.CrossRefGoogle Scholar

Blackett, D. W. 1958. Pure strategy solutions of Blotto games. Naval Research Logistics Quarterly, 5(2), 107–109.CrossRefGoogle Scholar

Bliss, C. I., Greenwood, Mary L., and White, Edna S. 1956. A rankit analysis of paired comparisons for measuring the effect of sprays on flavor. Biometrics, 12(4), 381–403.CrossRefGoogle Scholar

Bliss, Christopher, and Nalebuff, Barry. 1984. Dragon-slaying and ballroom dancing: The private supply of a public good. Journal of Public Economics, 25(1–2), 1–12.CrossRefGoogle Scholar

Böckenholt, Ulf. 1993. Applications of Thurstonian models to ranking data. Probability Models and Statistical Analysis for Ranking Data, Lecture Notes in Statistics Volume 80, 157–172.

Border, K. C. 1989. Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge: Cambridge University Press.Google Scholar

Borel, E. 1921. La théorie du jeu et les équations inté grales á noyau symétrique. Comptes Rendus de l'Académie des Sciences; English translation by L. Savage, The theory of play and integral equations with skew symmetric kernels, Econometrica 21 (1953), 97-100., 173, 1304–1308.Google Scholar

Borel, E., and Ville, J. 1938. Application de la théorie des probabilitiés aux jeux de hasard. Gauthier-Villars, Paris. Reprinted in E. Borel, A. Chéron, Théorie mathematique du bridge á la portée de tous, Editions Jacques Gabay, Paris, 1991.

Bos, Olivier. 2011. How lotteries outperform auctions. Economics Letters, 110(3), 262–264.CrossRefGoogle Scholar

Bouyssou, Denis. 1992. Ranking methods based on valued preference relations: A characterization of the net flow method. European Journal of Operational Research, 60(1), 61–67.CrossRefGoogle Scholar

Boyd, Stephen, and Vandenberghe, Lieven. 2004. Convex Optimization. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Bradley, Ralph Allan, and Terry, Milton E. 1952. Rank analysis of incomplete block designs: I. Method of paired comparisons. Biometrika, 39(3/4), 324–345.Google Scholar

Bradley, Ralph Allan, and Terry, Milton E. 1954. Rank analysis of incomplete block designs: II. Additional tables for the method of paired comparisons. Biometrika, 41(3/4), 502–537.Google Scholar

Bramoulle, Yann, and Kranton, Rachel. 2007. Public goods in networks. Journal of Economic Theory, 135(1), 478–494.CrossRefGoogle Scholar

Brémaud, Pierre. 2001. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues (Text in Applied Mathematics). 2nd ed. New York: Springer.Google Scholar

Brian, W. 1994. Inductive reasoning and bounded rationality. American Economic Review, 84(2), 406–411.Google Scholar

Brin, S., and Page, L. 1998. The anatomy of a large-scale hypertextualWeb search engine. Computer Networks and ISDN Systems, 30(1–7), 107–117.CrossRefGoogle Scholar

Buhlmann, Hans, and Huber, Peter J. 1963. Pairwise comparison and ranking in tournaments. Annals of Mathematical Statistics, 34(2), 501–510.CrossRefGoogle Scholar

Bulow, Jeremy, and Klemperer, Paul. 1996. Auctions versus negotiations. American Economic Review, 86(1), 180–94.Google Scholar

Bulow, Jeremy, and Klemperer, Paul. 1997. The generalized war of attrition. American Economic Review, 89(1), 175–189.Google Scholar

Burke, Moira, and Kraut, Robert. 2008. Mopping up: Modeling Wikipedia promotion decisions. Pages 27–36 of: Proceedings of the 2008 ACM Conference on Computer Supported Cooperative Work. CSCW ’08. New York: ACM.Google Scholar

Byers, John W., Mitzenmacher, Michael, and Zervas, Georgios. 2010. Information asymmetries in pay-per-bid auctions. Pages 1–12 of: Proceedings of the 11th ACM Conference on Electronic Commerce. EC ’10. New York: ACM.Google Scholar

Callaghan, Thomas, Mucha, Peter J., and Porter, Mason A. 2007. RandomWalker Ranking for NCAA Division I-A Football. American Mathematical Monthly, November.

Caragiannis, Ioannis, and Voudouris, Alexandros A. 2014. Welfare guarantees for proportional allocations. Pages 206–217 of: Proceedings of the 7th International Symposium on Algorithmic Game Theory. SAGT 2014.Google Scholar

Cattelan, Manuela. 2012. Models for paired comparison data: A review with emphasis on dependent data. Statistical Science, 27(3), 412–433.CrossRefGoogle Scholar

Celis, L. Elisa, Devanur, Nikhil R., and Peres, Yuval. 2010. Local dynamics in bargaining networks via random-turn games. Pages 133–144 of: Saberi, Amin (ed), Internet and Network Economics. Lecture Notes in Computer Science, vol. 6484. Springer: Berlin.CrossRefGoogle Scholar

Chakrabarti, A. S., Chakrabarti, B. K., Chatterjee, A., and Mitra, M. 2009. The Kolkata Paise Restaurant problem and resource utilization. Physica A Statistical Mechanics and its Applications, 388(June), 2420–2426.CrossRefGoogle Scholar

Charon, Irne, and Hudry, Olivier. 2010. An updated survey on the linear ordering problem for weighted or unweighted tournaments. Annals of Operations Research, 175(1), 107–158.CrossRefGoogle Scholar

Chawla, Shuchi, and Hartline, Jason D. 2013. Auctions with unique equilibrium. Pages 181–196 of: Proceedings of the 13th ACM Conference on Electronic Commerce. EC ’13, Philadelphia.

Chawla, Shuchi, Hartline, Jason D., and Sivan, Balasubramanian. 2012. Optimal crowdsourcing contests. Pages 856–868 of: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan.

Che, Yeon-Koo, and Gale, Ian L. 1998. Caps on political lobbying. The American Economic Review, 88(3), 643–651.Google Scholar

Che, Yeon-Koo, and Gale, Ian. 2000. Difference-form contests and the robustness of all-pay auctions. Games and Economic Behavior, 30(1), 22–43.CrossRefGoogle Scholar

Chen, R., and Hwang, F. K. 1988. Stronger players win more balanced knockout tournaments. Graphs and Combinatorics, 4(2), 95–99.CrossRefGoogle Scholar

Chen, Yan, Harper, F. Maxwell, Konstan, Joseph, and Li, Sherry Xin. 2010. Social comparisons and contributions to online communities: A field experiment on MovieLens. American Economic Review, 100(4), 1358–1398.CrossRefGoogle Scholar

Chernoff, Herman. 1952. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations. The Annals of Mathematical Statistics, 23(4), pp. 493–507.CrossRefGoogle Scholar

Chung, F. R. K., and Hwang, F. K. 1978. Do stronger players win more knockout tournaments? Journal of the American Statistical Association, 73(363), 593–596.CrossRefGoogle Scholar

Chung, Tai-Yeong. 1996. Rent-seeking contest when the prize increases with aggregate efforts. Public Choice, 87(1/2), 55–66.CrossRefGoogle Scholar

Clark, Derek J., and Nilssen, Tore. 2013. Learning by doing in contests. Public Choice, 156(1–2), 329–343.CrossRefGoogle Scholar

Clark, Derek J, and Riis, Christian. 1998a. Competition over more than one prize. American Economic Review, 88(1), 276–289.Google Scholar

Clark, Derek J., and Riis, Christian. 1998b. Contest Success Functions: An Extension. Economic Theory, 11(1), 201–204.CrossRefGoogle Scholar

Clark, Derek J., and Riis, Christian. 1998c. Influence and the discretionary allocation of several prizes. European Journal of Political Economy, 14(4), 605–625.CrossRefGoogle Scholar

Clarke, S. R., Norman, J.M., and Stride, C. B. 2009. Criteria for a tournament: The World Professional Snooker Championship. Journal of the Operational Research Society, 60(Feb.), 1670–1673.CrossRefGoogle Scholar

Cleverdon, C.W., and Mills, J. 1963. The testing of index language devices. Aslib Proceedings, 15(4), 106–130.CrossRefGoogle Scholar

Cobb, C. W., and Douglas, P. H. 1928. A theory of production. American Economic Review, 18(1), 139–165.Google Scholar

Cohen, Chen, Kaplan, Todd R., and Sela, Aner. 2008. Optimal rewards in contests. RAND Journal of Economics, 39(2), 434–451.CrossRefGoogle Scholar

Colley, Wesley N. 2013 (November). Colley Matrix. http://colleyrankings.com.

Cominetti, Roberto, Correa, Jose R., and Stier-Moses, Nicolas E. 2009. The impact of oligopolistic competition in networks. Operations Research, 57(6), 1421–1437.CrossRefGoogle Scholar

Congleton, Roger D., Hillman, Arye L., and Konrad, Kai A. 2008a. 40 Years of Research on Rent Seeking 1: Theory of Rent Seeking. New York: Springer.Google Scholar

Congleton, Roger D., Hillman, Arye L., and Konrad, Kai A. 2008b. 40 Years of Research on Rent Seeking 2: Applications: Rent Seeing in Practice. New York: Springer.Google Scholar

Conner, Gregory R., and Grant, Christopher P. 2000. An extension of Zermelo's model for ranking by paired comparisons. European Journal of Applied Mathematics, 11(December), 225–247.CrossRefGoogle Scholar

Conitzer, Vincent, and Sandholm, Tuomas. 2005. Common voting rules as maximum likelihood estimators. Pages 145–152 of: Proceedings of the 20th Conference on Uncertanity in Artifical Intelligence (UAI 2005), Edinburgh.

Contizer, Vincent. 2006. Computing Slater Rankings using similarities among candidates. In: Proceedings of the American Association for Artifical Intelligence. AAAI ’06, Boston, MA.Google Scholar

Cooper, William S. 1968. Expected search length: A single measure of retrieval effectiveness based on the weak ordering action of retrieval systems. American Documentation, 19(1), 30–41.CrossRefGoogle Scholar

Copeland, A. 1951. A ‘reasonable’ social welfare function, Seminar on Applications of Mathematics to Social Sciences, University of Michigan, MI.Google Scholar

Coppersmith, Don, Fleischer, Lisa, and Rudra, Atri. 2006. Ordering by weighted number of wins gives a good ranking for weighted tournaments. Pages 776–782 of: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. SODA ’06. New York: ACM.Google Scholar

Corbo, Jacomo, Calvó-Armengol, Antoni, and Parkes, David C. 2007. The importance of network topology in local contribution games. Pages 388–395 of: Deng, Xiaotie, and Graham, FanChung (eds), Internet and Network Economics. Lecture Notes in Computer Science, vol. 4858. Springer: Berlin.Google Scholar

Corchón, Luis C. 2007. The theory of contests: A survey. Review of Economic Design, 11(2), 69–100.CrossRefGoogle Scholar

Corchón, Luis C. 2008. Welfare losses under Cournot competition. International Journal of Industrial Organization, 26(5), 1120–1131.CrossRefGoogle Scholar

Corchón, Luis, and Dahm, Matthias. 2010. Foundations for contest success functions. Economic Theory, 43(1), 81–98.CrossRefGoogle Scholar

Corcoran, William J., and Karels, Gordon V. 1985. Rent-seeking behavior in the long-run. Public Choice, 46(3), 227–246.CrossRefGoogle Scholar

Cornes, Richard, and Hartley, Roger. 2003. Risk aversion, heterogeneity and contests. Public Choice, 117(1–2), 1–25.CrossRefGoogle Scholar

Cornes, Richard, and Hartley, Roger. 2005. Asymmetric contests with general technologies. Economic Theory, 26(4), 923–946.CrossRefGoogle Scholar

Correa, José R., Schultz, Andreas S., and Stier-Moses, Nicolás E. 2013. The price of anarchy of the proportional allocation mechanism revisited. Pages 109–120 of: Proceedings of the 9th International Conference on Web and Internet Economics, WINE 2013. WINE ’13, Cambridge, MA.Google Scholar

Courcoubetis, C., and Weber, R. 2006. Incentives for large peer-to-peer systems. IEEE Journal on Selected Areas in Communications, 24(5), 1034–1050.CrossRefGoogle Scholar

Cournot, A. A. 1838. Recherches sur les principes mathematiques de la theorie des richesses [microform]/ par Augustin Cournot. Paris: L. Hachette.Google Scholar

Cournot, Augustin. 1897. Researches into the Mathematical Principles of the Theory of Wealth. London: MacMillan & Co., Ltd., translation of original book published in 1838.Google Scholar

Cover, Thomas M., and Thomas, Joy A. 2006. Elements of Information Theory. 2nd ed. New York: John Wiley & Sons.Google Scholar

Daniels, H. E. 1950. Rank correlation and population methods. Journal of the Royal Statistical Society, Series B (Methodological), 12(2), 171–191.Google Scholar

Dasgupta, A., and Nti, K. O. 1998. Designing an optimal contest. European Journal of Political Economy, 14(4), 587–603.CrossRefGoogle Scholar

Dasgupta, P. 1986. The theory of technological competition. In: J. E., Stiglitz and G. F., Mathewson (eds.) New Developments in the Analysis of Market Structure. Cambridge: MIT Press.Google Scholar

Dasgupta, P. S., and Heal, G. M. 1979. Economic Theory and Exhaustible Resources. Cambridge: Cambridge University Press.Google Scholar

Dasgupta, Partha, and Stiglitz, Joseph. 1980. Industrial structure and the nature of innovative activity. Economic Journal, 90(358), 266–293.CrossRefGoogle Scholar

David, H. A. 1963. The Method of Paired Comparisons. London: CharlesGriffin&Company Limited.Google Scholar

Davidson, R. R. 1970. On extending the Bradley-Terry model to accommodate ties in paired comparison experiments. Journal of the American Statistical Association, 65(329), 317–328.CrossRefGoogle Scholar

Davidson, Roger R., and Solomon, Daniel L. 1973. A bayesian approach to paired comparison experimentation. Biometrika, 60(3), 477–487.CrossRefGoogle Scholar

Dawid, A. P., and Skene, A. M. 1979. Maximum likelihood estimation of observer error-rates using the EM algorithm. Applied Statistics, 28(1), 20–28.CrossRefGoogle Scholar

Dawkins, Richard. 1969. A threshold model of choice behaviour. Animal Behaviour, 17(Part 1), 120–133.Google Scholar

Debreu, G. 1952. A social equilibrium existence theorem. Proceedings of the National Academy of Sciences, 38(10), 886–893.CrossRefGoogle ScholarPubMed

Dechenaux, Emmanuel, Kovenock, Dan, and Sheremeta, Roman. 2012. A Survey of Experimental Research on Contests, All-Pay Auctions and Tournaments. Working Papers 12-22. Chapman University, Economic Science Institute.Google Scholar

Diaconis, P. 1988. Group Representation in Probability and Statistics. IMSLecture Series 11, Institute of Mathematical Statistics.

Diaconis, Persi, and Graham, R. L. 1977. Spearman's footrule as a measure of disarray. Journal of the Royal Statistical Society. Series B (Methodological), 39(2), 262–268.Google Scholar

DiPalantino, Dominic, and Vojnović, Milan. 2009. Crowdsourcing and all-pay auctions. Pages 119–128 of: Proceedings of the 10th ACM Conference on Electronic Commerce. EC'09. New York: ACM.Google Scholar

Dixit, Avinash. 1987. Strategic behavior in contests. American Economic Review, 77(Dec.), 891–898.Google Scholar

Dixit, Avinash, and Nalebuff, Barry J. 2008. The Art of Strategy. New York: W. W. Norton & Co.Google Scholar

Dixon, Mark J., and Coles, Stuart G. 1997. Modelling association football scores and inefficiencies in the football betting market. Journal of the Royal Statistical Society: Series C (Applied Statistics), 46(2), 265–280.Google Scholar

Dodgson, Charles L. 1883. Lawn Tennis Tournaments: The True Method of Assigning Prizes with a Proof of the Fallacy of the Present Method. London: McMillan and Co.Google Scholar

Donmez, Pinar, Carbonell, Jaime G., and Schneider, Jeff. 2009. Efficiently learning the accuracy of labeling sources for selective sampling. Pages 259–268 of: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD ’09. New York: ACM.Google Scholar

Draief, M., and Vojnović, M. 2010. Bargaining dynamics in exchange networks. Pages 1303–1310 of: the 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010. Allerton, IL.

Dror, Gideon, Koren, Yehuda, Maarek, Yoelle, and Szpektor, Idan. 2011. I want to answer, who has a question? Yahoo! answers recommender system. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, San Diego, CA, 1109–1117.Google Scholar

Duchi, John C., Mackey, Lester W., and Jordan, Michael I. 2010. On the consistency of ranking algorithms. Pages 227–234 of: Proceedings of the 27th International Conference on Machine Learning Haifa.

Dudley, R. M. 2002. Real Analysis and Probability. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Dwork, Cynthia, Kumar, Ravi, Naor, Moni, and Sivakumar, D. 2001a. Rank aggregation methods for the Web. Pages 613–622 of: Proceedings of the 10th International Conference on World Wide Web. WWW ’01. New York: ACM.Google Scholar

Dwork, Cynthia, Kumar, Ravi, Naor, Moni, and Sivakumar, D. 2001b. Rank Aggregation Revisited. Unpublished manuscript.

Dykstra Jr., Otto. 1956. A note on the rank analysis of incomplete block designs – applications beyond the scope of existing tables. Biometrics, 12(3), 301–306.CrossRefGoogle Scholar

Dykstra Jr., Otto. 1960. Rank analysis of incomplete block designs: A method of paired comparisons employing unequal repetitions on pairs. Biometrics, 16(2), 176–188.CrossRefGoogle Scholar

Ellingsen, Tore. 1991. Strategic buyers and the social cost of monopoly. The American Economic Review, 81(3), 648–657.Google Scholar

Ellison, Glenn, and Fudenberg, Drew. 2003. Knife-edge or plateau: When do market models tip?Quarterly Journal of Economics, 118(4), 1249–1278.CrossRefGoogle Scholar

Ellison, Glenn, Fudenberg, Drew, and Möbius, Markus. 2004. Competing auctions. Journal of the European Economic Association, 2(1), 30–66.CrossRefGoogle Scholar

Elo, Arpad E. 1978. The Rating of Chessplayers. San Jose, CA: Ishi Press International.Google Scholar

Engelbrecht-Wiggans, R., and Weber, R. 1979. An example of a multiobject auction game. Management Science, 25(12), 1272–1277.CrossRefGoogle Scholar

English, James F. 2005. The Economy of Prestige. Cambridge, MA: Harvard University Press.CrossRefGoogle Scholar

Epstein, A., Feldman, M., and Mansour, Y. 2009. Strong equilibrium in cost sharing connection games. Games and Economic Behavior, 67(1), 51–68.CrossRefGoogle Scholar

Epstein, Richard A. 2013. The Theory ofGambling and Statistical Logic. 2nd ed.New York:Academic Press.Google Scholar

Ertekin, Seyda, Hirsh, Haym, and Rudin, Cynthia. 2011. Approximating the wisdom of crowds. In: Proceedings of the SecondWorkshop on Computational Social Science and theWisdom of Crowds, Tweenty-Fifth Annual Conference on Neural Information Processing Systems. NIPS ’11, Sierra Nevada, Spain.Google Scholar

Ertekin, Seyda, Hirsh, Haym, and Rudin, Cynthia. 2012. Learning to predict the wisdom of crowds. In: Proceeding of Collective Intelligence. CI ’12, Cambridge, MA.Google Scholar

Even-dar, Eyal, Mansour, Yishay, and Nadav, Uri. 2009. On the convergence of regret minimization dynamics in concave games. Pages 523–532 of: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. STOC ’09, Bethesda, Maryland.Google Scholar

Fagin, Ronald, Kumar, Ravi, Mahdian, Mohammad, Sivakumar, D., and Vee, Erik. 2006. Comparing partial rankings. SIAM Journal of Discrete Mathematics, 20(3), 628–648.CrossRefGoogle Scholar

Fagin, Ronald, Kumar, Ravi, and Sivakumar, D. 2003. Comparing top k lists. Pages 28–36 of: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’03. Philadelphia: Society for Industrial and Applied Mathematics.Google Scholar

Fang, H. 2002. Lottery versus all-pay auction models of lobbying. Public Choice, 112(3–4), 351–371.CrossRefGoogle Scholar

Farrell, Joseph, and Simcoe, Timothy. 2012. Choosing the rules for consensus standardization. RAND Journal of Economics, 43(2), 235–252.CrossRefGoogle Scholar

Feigin, P., and Cohen, A. 1978. On a model for concordance between judges. Journal of the Royal Statistical Society, B(40), 203–213.Google Scholar

Feldman, Michal, Fu, Hu, Gravin, Nick, and Lucier, Brendan. 2013. Simultaneous auctions are (almost) efficient. Pages 201–210 of: Proceedings of the 45th Annual ACM Symposium on Theory of Computing. STOC ’13. New York: ACM.Google Scholar

Feldman, Michal, Lai, Kevin, and Zhang, Li. 2005. A price-anticipating resource allocation mechanism for distributed shared clusters. Pages 127–136 of: Proceedings of the 6th ACM Conference on Electronic Commerce, Vancouver, Canada.Google Scholar

Feller, William. 1957. An Introduction to Probability Theory and Its Applications: Volume I. 2nd ed. New York: John Wiley & Sons, Inc.Google Scholar

Fibich, Gadi, and Gavish, Nir. 2012. Asymmetric First-Price Auctions – A Dynamical-Systems Approach. Mathematics Operation Research, 37(2), 219–243.CrossRefGoogle Scholar

Finley, M. I., and Pleket, H. W. 2005. The Olympic Games: The First Thousand Years. New York: Dover Publications Inc.Google Scholar

Fisher, R. A., and Tippett, L. H. C. 1928. Limiting forms of the frequency distribution of the largest or smallest member of a sample. Proceedings of the Cambridge Philosophical Society, 24, 180–190.CrossRefGoogle Scholar

Ford Jr., L. R. 1957. Solution of a ranking problem from binary comparisons. American Mathematical Monthly, 64(8), 28–33.Google Scholar

Forte, A., and Bruckman, A. 2005. Why do people write forWikipedia? Pages 6–9 of: Proceedings of the GROUP 05 Workshop - Sustaining Community: The Role and Design of Incentive Mechanisms in Online Systems, Sanibel Island, FL.Google Scholar

Frank, C. R. Jr., and Quandt, R. E. 1963. On the existence of Cournot equilibrium. International Economic Review, 6(1), 92–96.Google Scholar

Frank, Robert H. 1985. Choosing the Right Pond: Human Behavior and the Quest for Status. Oxford: Oxford University Press.Google Scholar

Frank, Robert H., and Cook, Philip J. 2010. The Winner-Take-All-Society. New York: Virgin Books.Google Scholar

Franke, Jr.Kanzow, Christian, Leininger, Wolfgang, and Schwartz, Alexandra. 2011. Effort maximization in asymmetric contest games with heterogeneous contestants. Economic Theory, 52(2), 589–630.Google Scholar

Frechét, M. 1927. Su la loi de probabilitié de l’écart maximum. Annals of the Society of Polonaise Mathematics, 6, 92–116.Google Scholar

Friedman, Eric J. 2004. Strong monotonicity in surplus sharing. Economic Theory, 23(3), 643–658.CrossRefGoogle Scholar

Friedman, Eric, and Moulin, Hervé. 1999. Three methods to share joint costs or surplus. Journal of Economic Theory, 87(2), 275–312.CrossRefGoogle Scholar

Friedman, James. 1977. Oligopoly and the Theory of Games. Amsterdam: North-Holland.Google Scholar

Friedman, James. 1983. Oligopoly and Noncooperative Game Theory. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Fu, Qiang. 2006. Endogenous timing of contest with asymmetric information. Public Choice, 129(1/2), 1–23.CrossRefGoogle Scholar

Fu, Qiang, and Lu, Jingfeng. 2010. Contest design and optimal endogenous entry. Economic Inquiry, 48(1), 80–88.CrossRefGoogle Scholar

Fu, Qiang, and Lu, Jingfeng. 2012. The optimal multi-stage contest. Economic Theory, 51(2), 351– 382.CrossRefGoogle Scholar

Fudenberg, Drew, and Tirole, Jean. 1986. A theory of exit in duopoly. Econometrica, 54(4), 943–60. Fudenberg, Drew, and Tirole, Jean. 1991. Game Theory. Cambridge, MA: MIT Press.CrossRefGoogle Scholar

Fullerton, Richard L., and McAfee, R. Preston. 1999. Auctioning entry into tournaments. Journal of Political Economy, 107(3), 573–605.CrossRefGoogle Scholar

Gabay, D., and Moulin, H. 1980. On the uniqueness and stability of nash-equilibria in noncooperative games. In: Applied Stochastic Control in Econometrics and Management Science (A. Bensoussan et al, Eds.). New York: North-Holland.Google Scholar

Galambos, J. 1978. The Asymptotic Theory of Extreme Order Statistics. New York: Wiley.Google Scholar

Galeur, Ian, and Stegema, Mark. 1994. Exclusion in all-pay auctions.Working Paper. Federal Reserve Bank of Cleveland.

Galeotti, Andrea, and Goyal, Sanjeev. 2010. The law of the few. American Economic Review, 100(4), 1468–1492.CrossRefGoogle Scholar

Galeotti, Andrea, Goyal, Sanjeev, and Kamphorst, Jurjen. 2006. Network formation with heterogeneous players. Games and Economic Behavior, 54(2), 353–372.CrossRefGoogle Scholar

Galton, Francis. 1902. The most suitable proportion between the value of first and second prizes. Biometrika, 1(4), 385–399.CrossRefGoogle Scholar

Garfinkel, Michelle R., and Skaperdas, Stergios. 2007. Economics of Conflict: An Overview. Handbook of Defense Economics, vol. 2. New York: Elsevier. Chap. 22, pages 649–709.Google Scholar

Gaudet, Gerard, and Salant, Stephen W. 1991. Uniqueness of Cournot equilibrium: New results from old methods. Review of Economic Studies, 58(2), 399–404.CrossRefGoogle Scholar

Gerchak, Yigal, and He, Qi-Ming. 2003. When will the range of prizes in tournaments increase in the noise or in the number of players?International Game Theory Review, 5(2), 151–165.CrossRefGoogle Scholar

Gerding, Enrico H., Dash, Rajdeep K., Byde, Andrew, and Jennings, Nicholas R. 2008. Optimal strategies for bidding agents participating in simultaneousVickrey auctions with perfect substitutes. Journal of Artificial Intelligence Research, 32(1), 939–982.Google Scholar

Ghemawat, Pankaj, and Nalebuff, Barry. 1985. Exit. RAND Journal of Economics, 16(2), 184–194.CrossRefGoogle Scholar

Ghodsi, Ali, Zaharia, Matei, Hindman, Benjamin, Konwinski, Andy, Shenker, Scott, and Stoica, Ion. 2011. Dominant resource fairness: Fair allocation of multiple resource types. Pages 24–24 of: Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation. NSDI'11. Berkeley, CA: USENIX Association.Google Scholar

Ghosh, Arpita, and Hummel, Patrick. 2012. Implementing optimal outcomes in social computing: A game-theoretic approach. Pages 539–548 of: Proceedings of the 21st International Conference on the World Wide Web. WWW ’12. New York: ACM.Google Scholar

Ghosh, Arpita, and Kleinberg, Jon. 2013. Incentivizing participation in online forums for education. Pages 525–542 of: Proceedings of the Fourteenth ACM Conference on Electronic Commerce. EC ’13. New York: ACM.Google Scholar

Ghosh, Arpita, and McAfee, Preston. 2012. Crowdsourcing with endogenous entry. Pages 999–1008 of: Proceedings of the 21st International Conference on the World Wide Web. WWW ’12. New York: ACM.Google Scholar

Glazer, Amihai, and Hassin, Refael. 1988. Optimal contests. Economic Inquiry, 26(1), 133–143.CrossRefGoogle Scholar

Glazer, Amihai, and Hassin, Rafael. 2000. Sequential rent seeking. Public Choice, 102(3–4), 219–228.CrossRefGoogle Scholar

Glazer, Jacob, and Ma, Ching-to Albert. 1989. Efficient allocation of a “prize”: King Solomon's dilemma. Games and Economic Behavior, 1(3), 222–233.CrossRefGoogle Scholar

Glenn, W. A., and David, H. A. 1960. Ties in paired-comparison experiments using a modified Thurstone-Mosteller model. Biometrics, 16(1), 86–109.CrossRefGoogle Scholar

Gnedenko, B. 1943. Sur la distribution limite du terme maximum d'une serie aletoire. Annals of Mathematics, 44, 423–453.CrossRefGoogle Scholar

Goemans, Michel, Li, Li Erran, Mirrokni, Vahab S., and Thottan, Marina. 2004. Market sharing games applied to content distribution in ad-hoc networks. Pages 55–66 of: Proceedings of the 5th ACM International Symposium on Mobile ad hoc Networking and Computing. MobiHoc ’04. New York: ACM.Google Scholar

Goyal, Sanjeev, and Vega-Redondo, Fernando. 2005. Network formation and social coordination. Games and Economic Behavior, 50(2), 178–207.CrossRefGoogle Scholar

Gradstein, Mark. 1993. Rent seeking and the provision of public goods. Economic Journal, 103(420), 1236–1243.CrossRefGoogle Scholar

Gradstein, Mark. 1995. Intensity of competition, entry and entry deterrence in rent seeking contests. Economics and Politics, 7(1), 79–91.CrossRefGoogle Scholar

Gradstein, Mark. 1998. Optimal contest design: Volume and timing of rent seeking in contests. European Journal of Political Economy, 14(4), 575–585.CrossRefGoogle Scholar

Gradstein, Mark, and Konrad, K. A. 1999. Orchestrating rent seeking contests. Economic Journal, 109(458), 536–545.CrossRefGoogle Scholar

Gradstein, Mark, and Nitzan, Shmuel. 1986. Performance evaluation of some special classes of weighted majority rules. Mathematical Social Sciences, 12(1), 31–46.CrossRefGoogle Scholar

Gradstein, Mark, and Nitzan, Shmuel. 1989. Advantageous multiple rent seeking. Mathematical and Computer Modelling, 12(45), 511–518.CrossRefGoogle Scholar

Griffiths, M. 2012. Knockout-tournament scenarios accounting for byes. Mathematical Scientist, 37(1), 34–46.Google Scholar

Groh, Christian, Moldovanu, Benny, Sela, Aner, and Sunde, Uwe. 2012. Optimal seedings in elimination tournaments. Economic Theory, 49(1), 59–80.CrossRefGoogle Scholar

Gross, Oliver Alfred, and Wagner, R. A. 1950.Acontinuous ColonelBlotto game.RANDCorporation, RM-408.

Guiver, John, and Snelson, Edward. 2009. Bayesian inference for Plackett-Luce ranking models. Pages 377–384 of: Proceedings of the 26th Annual International Conference on Machine Learning. ICML ’09. New York: ACM.Google Scholar

Gul, Faruk, and Lundholm, Russell. 1995. Endogenous timing and the clustering of agents’ decisions. Journal of Political Economy, 103(5), 1039–1066.CrossRefGoogle Scholar

Guo, X., and Yang, H. 2005. The price of anarchy of Cournot oligopoly. Pages 246–257 of:Workshop on Internet and Network Economics (WINE), Hong Kong, China.Google Scholar

Haan, Laurens de. 1976. Sample extremes: An elementary introduction. Statistica Neerlandica, 30(4), 161–172.CrossRefGoogle Scholar

Haigh, John, and Cannings, Chris. 1989. The n-person war of attrition. Acta Applicandae Mathematica, 14(1–2), 59–74.CrossRefGoogle Scholar

Hajek, B., and Gopalakrishnan, G. 2002. Do greedy autonomous systems make for a sensible Internet? talk slides, Stochastic Networks Conference, Stanford University, http://www.ifp.illinois.edu/ ~hajek/Papers/stochnets02.pdf.

Haldane, J. B. S. 1932. A note on inverse probability. Mathematical Proceedings of the Cambridge Philosophical Society, 28(1), 55–61.CrossRefGoogle Scholar

Hann, Il-horn, Roberts, Jeff, and Slaughter, Ra. 2002. Why do developers contribute to open source projects? First evidence of economic incentives. In: First Evidence of Economic Incentives, Proceedings of the 2nd Workshop on Open Source Software Engineering, Orlando.Google Scholar

Harbaugh, Rick, and Klumpp, Tilman. 2005. Early round upsets and championship blowouts. Economic Inquiry, 43(2), 316–329.CrossRefGoogle Scholar

Hardin, Garrett. 1968. The tragedy of the commons. Science, 162(3859), 1243–1248.Google ScholarPubMed

Hardy, G., Littlewood, J. E., and Pólya, G. 1952. Inequalities. 2nd ed. Cambridge: Cambridge University Press.Google Scholar

Harks, T. 2008. Stackelberg strategies and collusion in network games with splittable flow. Pages 133–146 of: Proceedings of 6th InternationalWorkshop on Approximation and Online Algorithms. WAOA ’08, Karlsruhe, Germany.Google Scholar

Harris, T. E. 1960. A lower bound for the critical probability in a certain percolation process. Mathematical Proceedings of the Cambridge Philosophical Society, 56(1), 13–20.CrossRefGoogle Scholar

Harris, Christopher, and Vickers, John. 1987. Racing with uncertainty. Review of Economic Studies, LIV, 1–21.Google Scholar

Hars, A., and Ou, S. 2001. Working for free? motivations of participating in open source projects. Pages 7014– of: Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34)-Volume 7 – Volume 7. HICSS ’01. Washington DC: IEEE Computer Society.Google Scholar

Harsanyi, John C. 1967. Games with incomplete information played by Bayesian players, III part I. The basic model. Management Science, 14(3), 159–182.CrossRefGoogle Scholar

Harsanyi, John C. 1968a. Games with incomplete information played by Bayesian players part II. Bayesian equilibrium points. Management Science, 14(5), 320–334.Google Scholar

Harsanyi, John C. 1968b. Games with incomplete information played by Bayesian players, part III. The basic probability distribution of the game. Management Science, 14(7), 486–502.Google Scholar

Harstad, Ronald M., Kagel, John H., and Levin, Dan. 1990. Equilibrium bid functions for auctions with an uncertain number of bidders. Economics Letters, 33(1), 35–40.CrossRefGoogle Scholar

Hart, Sergiu. 2008. Discrete Colonel Blotto and General Lotto games. International Journal of Game Theory, 36(3), 441–460.CrossRefGoogle Scholar

HartlineJason, D. 2012. Bayesian Mechanism Design. Foundations and Trends ® in Theoretical Computer Science, 8(3), 143–263.Google Scholar

Harville, David A. 1977. The use of linear-model methodology to rate high school or college football teams. Journal of the American Statistical Association, 72(358), 278–289.CrossRefGoogle Scholar

Harville, David A. 1980. Predictions for national football league games via linear-modelmethodology. Journal of the American Statistical Association, 75(371), 516–524.CrossRefGoogle Scholar

Harville, David A., and Smith, Michael H. 1994. The home-court advantage: How large is it, and does it vary from team to team?The American Statistician, 48(1), 22–28.Google Scholar

Hassidim, Avinatan, Kaplan, Haim, Mansour, Yishay, and Nisan, Noam. 2011. Non-price equilibria in markets of discrete goods. Pages 295–296 of: Proceedings of the 12th ACM Conference on Electronic Commerce. EC ’11. New York: ACM.Google Scholar

Hatfield, John, and Duke Kominers, Scott. 2011. Multilateral matching. Pages 337–338 of: Proceedings of the 12th ACM Conference on Electronic Commerce. EC ’11. New York: ACM.Google Scholar

Hemaspaandra, Edith, Spakowski, Holger, and Vogel, Jörg. 2005. The complexity of Kemeny elections. Theoretical Computer Science, 349(3), 382–391.CrossRefGoogle Scholar

Hendricks, Ken, Weiss, Andrew, and Wilson, Charles A. 1988. The war of attrition in continuous time with complete information. International Economic Review, 29(4), 663–80.CrossRefGoogle Scholar

Henery, Robert J. 1983. Permutation probabilities for Gamma random variables. Journal of Applied Probability, 20, 822–834.CrossRefGoogle Scholar

Henriet, D. 1985. The Copeland choice function: An axiomatic characterization. Social Choice and Welfare, 2(1), 49–63.CrossRefGoogle Scholar

Higgins, R., Shughart, W., and Tollison, R. D. 1885. Free entry and efficient rent seeking. Public Choice, 46, 247–258.Google Scholar

Hillman, Arye L. 1988. The Political Economy of Protectionism. New York: Harwood.Google Scholar

Hillman, Arye L., and Katz, Eliakim. 1984. Risk-averse rent seekers and the social cost of monopoly power. Economic Journal, 94(373), 104–110.CrossRefGoogle Scholar

Hillman, Arye L., and Riley, John G. 1989. Politically contestable rents and transfers. Economics and Politics, 1(1), 17–39.CrossRefGoogle Scholar

Hillman, Arye L., and Samet, Dov. 1987. Dissipation of contestable rents by small number of contenders. Public Choice, 54(1), 63–82.CrossRefGoogle Scholar

Hirshleifer, Jack. 1983. From weakest-link to best-shot: The voluntary provision of public goods. Public Choice, 41(3), 371–386.CrossRefGoogle Scholar

Hirshleifer, Jack. 1989. Conflict and rent-seeking success functions: Ratio vs. difference models of relative success. Public Choice, 63(2), 101–112.CrossRefGoogle Scholar

Hirshleifer, Jack. 1991. The paradox of power. Economics & Politics, 3(3), 177–200.CrossRefGoogle Scholar

Hirshleifer, Jack, and Riley, John G. 1992. The Analytics of Uncertainty and Information. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Ho, Chien-Ju, and Vaughan, Jennifer Wortman. 2012. Online task assignment in crowdsourcing markets. In: Proceedings of the Twenty-Sixth AAAI Conference on Artifical Intelligence (AAAI 2012), Toronto, Canada.Google Scholar

Hoeffding, Wassily. 1963. Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association, 58(301), pp. 13–30.CrossRefGoogle Scholar

Hoffmann, Magnus, and Rota-Graziosi, Grégoire. 2012. Endogenous timing in general rent-seeking and conflict models. Games and Economic Behavior, 75(1), 168–184.CrossRefGoogle Scholar

Horen, Jeff, and Riezman, Raymond. 1985. Comparing draws for single elimination tournaments. Operations Research, 33(2), 249–261.CrossRefGoogle Scholar

Hörner, Johannes. 2004. A perpetual race to stay ahead. Review of Economic Studies, 71(4), 1065– 1088.CrossRefGoogle Scholar

Hortala-Vallve, Rafael, and Llorente-Saguer, Aniol. 2012. Pure strategy Nash equilibria in non-zero sum colonel Blotto games. International Journal of Game Theory, 41(2), 331–343.CrossRefGoogle Scholar

Howe, Jeff. 2006a. Crowdsourcing: A Definition, http://crowdsourcing.typepad.com/cs/2006/06/ crowdsourcing a.html.

Howe, Jeff. 2006b. Crowdsourcing: Why the Power of the Crowd Is Driving the Future of Business. New York: Crown Business.Google Scholar

Huang, Tzu-Kuo, Weng, Ruby C., and Lin, Chih-Jen. 2006. Generalized Bradley-Terry models and multi-class probability estimates. Journal of Machine Learning Research, 7(Jan), 85–115.Google Scholar

Huber, Peter J. 1963. Pairwise comparison and ranking: Optimum properties of the rowsumprocedure. Annals of Mathematical Statistics, 34(2), 511–520.CrossRefGoogle Scholar

Hunter, David R. 2004. MM algorithms for generalized Bradley-Terry models. Annals of Statistics, 32(1), 384–406.Google Scholar

Huyck, John B. Van, Battalio, Raymond C., and Beil, Richard O. 1990. Tacit coordination games, strategic uncertainty, and coordination failure. The American Economic Review, 80(1), 234–48.Google Scholar

Hwang, F. K. 1982. New concepts in seeding knockout tournaments. American Mathematical Monthly, 89(April), 235–239.CrossRefGoogle Scholar

Hwang, F. K., Zong-zhen, Lin, and Yao, Y. C. 1991. Knockout tournaments with diluted Bradley-Terry preference schemes. Journal of Statistical Planning and Inference, 28(1), 99– 106.CrossRefGoogle Scholar

Immorlica, Nicole, Kranton, Rachel, and Stoddard, Gregory. 2012. Striving for social status. Page 672 of: Proceedings of the 13th ACM Conference on Electronic Commerce. EC ’12. New York: ACM.Google Scholar

Immorlica, Nicole, Markakis, Evangelos, and Piliouras, Georgios. 2010. Coalition formation and price of anarchy in Cournot oligopolies. Pages 270–281 of: Workshop on Internet and Network Economics (WINE), Stanford, CA.Google Scholar

Ipeirotis, Panagiotis G., Provost, Foster, and Wang, Jing. 2010. Quality management on Amazon Mechanical Turk. Pages 64–67 of: Proceedings of the ACM SIGKDD Workshop on Human Computation. HCOMP ’10. New York: ACM.Google Scholar

Israel, R. 1982. Stronger players need not win more knockout tournaments. Journal of the American Statistical Association, 76(376), 950–951.Google Scholar

Jackson, J. E., and Fleckenstein, M. 1957. An evaluation of some statistical techniques used in the analysis of paired comparisons. Biometrics, 13(1), 51–64.CrossRefGoogle Scholar

Jackson, Matthew O. 2008. Social and Economic Networks. Princeton, NJ: Princeton University Press.Google Scholar

Jackson, Matthew O., and Wolinsky, Asher. 1996. A strategic model of social and economic networks. Journal of Economic Theory, 71(1), 44–74.CrossRefGoogle Scholar

Jain, Shaili, Chen, Yiling, and Parkes, David C. 2009. Designing incentives for online question and answer forums. Pages 129–138 of: Proceedings of the 10th ACM Conference on Electronic Commerce. EC'09. New York: ACM.

Jain, Shaili, and Parkes, David C. 2008. A game-theoretic analysis of games with a purpose. Pages342–350 of: Proceedings of the 4th International Workshop on Internet and Network Economics. WINE ’08. Berlin: Springer-Verlag.Google Scholar

Järvelin, Kalervo, and Kekäläinen, Jaana. 2002. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4), 422–446.CrossRefGoogle Scholar

Jech, Thomas. 1983. The ranking of incomplete tournaments: A mathematician's guide to popular sports. American Mathematical Monthly, 90(4), 246–264, 265–266.CrossRefGoogle Scholar

Jensen, J. L. W. V. 1906. Sur les fonctions convexes et les inģalités entre les valeurs moyennes. Acta Mathematica, 30(1), 175–193.CrossRefGoogle Scholar

Jia, Hao. 2008. A stochastic derivation of the ratio form of contest success functions. Public Choice, 135(3), 125–130.CrossRefGoogle Scholar

Joe-Wong, C., Sen, S., Lan, Tian, and Chiang, Mung. 2012 (March). Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework. Pages 1206–1214 of: Proceedings of IEEE Infocom 2012.

Johari, Ramesh, and Tsitsiklis, John N. 2004. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29(3), 402–435.CrossRefGoogle Scholar

Jurczyk, Pawel, and Agichtein, Eugene. 2007. Discovering authorities in question answer communities by using link analysis. Pages 212–22 of: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management. CIKM 2007, Lisbon.

Kamvar, S. D., Schlosser, M. T., and Garcia-Molina, H. 2003. The eigentrust algorithm for reputation management in P2P networks. Pages 640–651 of: Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary.Google Scholar

Kannappan, Palaniappan. 2009. Functional Equations and Inequalities with Applications. Berlin: Springer.CrossRefGoogle Scholar

Kanoria, Yashodhan, Bayati, Mohsen, Borgs, Christian, Chayes, Jennifer, and Montanari, Andrea. 2011. Fast convergence of natural bargaining dynamics in exchange networks. Pages 1518–1537 of: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’11. ACM-SIAM, San Francisco, CA.Google Scholar

Kaplan, Edward H., and Gartska, Stanley J. 2001. March madness and the office pool. Management Science, 47(3), 369–382.CrossRefGoogle Scholar

Karger, D. R., Sewoong, Oh, and Shah, D. 2011a. Budget-optimal crowdsourcing using low-rank matrix approximations. In: 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Allerton, IL.Google Scholar

Karger, David R., Oh, Sewoong, and Shah, Devavrat. 2014. Budget-optimal task allocation for reliable crowdsourcing systems. Operations Research, 62(1), 1–24.CrossRefGoogle Scholar

Katz, Eliakim, Nitzan, Shmuel, and Rosenberg, Jacob. 1990. Rent-seeking for pure public goods. Public Choice, 65(1), 49–60.CrossRefGoogle Scholar

Keener, James P. 1993. The perron-frobenius theorem and the ranking of football teams. SIAM Review, 35(1), 80–93.CrossRefGoogle Scholar

Keller, Joseph B. 1994. A characterization of the Poisson distribution and the probability of winning a game. American Statistician, 48(4), 294–298.Google Scholar

Kelly, Frank. 1997. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8(1), 33–37.CrossRefGoogle Scholar

Kelly, Frank, and Yudovina, Elena. 2014. Stochastic Networks. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Kemeny, John. 1959. Mathematicswithout numbers. Daedalus, 88(4), Quantity andQuality, 577–591.Google Scholar

Kemeny, John G., and Snell, J. Laurie. 1972. Mathematical Models in the Social Sciences. NewYork: Blaisdell, 1962. Reprinted by MIT Press, Cambridge, 1972.Google Scholar

Kendall, Graham, Knust, Sigrid, Ribeiro, Celso C., and Urrutia, Sebastián. 2010. Scheduling in sports: An annotated bibliography. Computers & Operations Research, 37(1), 1–19.Google Scholar

Kendall, M. G. 1955. Further contributions to the theory of paired comparisons. Biometrics, 11(1), 43–62.CrossRefGoogle Scholar

Kendall, M. G., and Smith, B. Babington. 1940. On the method of paired comparions. Biometrika, 31(3/4), 324–345.CrossRefGoogle Scholar

Kennan, John, and Wilson, Robert. 1989. Strategic bargaining models and interpretation of strike data. Journal of Applied Econometrics, 4(S1), 87–130.CrossRefGoogle Scholar

Kenyon-Mathieu, Claire, and Schudy, Warren. 2007. How to rank with few errors. Pages 95–103 of: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing. STOC ’07. New York: ACM.Google Scholar

Kirill, . 2013 (October). The World Football Elo Rating System, http://www.eloratings.net.

Kirkegaard, René. 2012. Favoritism in asymmetric contests: Head starts and handicaps. Games and Economic Behavior, 76(1), 226–248.CrossRefGoogle Scholar

Kitcher, Philip. 1990. The division of cognitive labor. Journal of Philosophy, 87(1), 5–22.CrossRefGoogle Scholar

Kitcher, Philip. 1993. The Advancement of Science. Oxford: Oxford University Press.Google Scholar

Kleinberg, Jon. 1999. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5), 604–632.CrossRefGoogle Scholar

Kleinberg, Jon, and Oren, Sigal. 2011. Mechanisms for (mis)allocating scientific credit. Pages 529– 538 of: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing. STOC ’11. New York: ACM.Google Scholar

Kleinberg, Jon, and Tardos, Éva. 2008. Balanced outcomes in social exchange networks. Pages 295– 304 of: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. STOC ’08. New York: ACM.Google Scholar

Klemperer, Paul. 1987. Markets with consumer switching costs. Quarterly Journal of Economics, 102(2), 375–94.CrossRefGoogle Scholar

Klemperer, Paul. 2004. Auctions: Theory and Practice. Princeton, NJ: Princeton University Press.Google Scholar

Kluberg, Jonathan, and Perakis, Georgia. 2012. Generalized quantity competition for multiple products and loss of efficiency. Operations Research, 60(2), 335–350.CrossRefGoogle Scholar

Knuth, D. E. 1987. A random knockout tournament: Problem 86-2. SIAM Review, 29 (March), 127–129.CrossRefGoogle Scholar

Kolmar, Martin, and Wagener, Andreas. 2012. Contests and the private production of public goods. Southern Economic Journal, 79(1), 161–179.CrossRefGoogle Scholar

Konig, Ruud H. 2000. Competitive balance in Dutch soccer. Journal of the Royal Statistical Society Series D, 49, 419–431.Google Scholar

Konrad, Kai, and Leininger, Wolfgang. 2007. The generalized Stackelberg equilibrium of the all-pay auction with complete information. Review of Economic Design, 11(2), 165–174.CrossRefGoogle Scholar

Konrad, Kai A. 2009. Strategy and Dynamics in Contests. Oxford: Oxford University Press.Google Scholar

Konrad, Kai A. 2012. Dynamic contests and the discouragement effect. Revue d’économie politique, 122(2), 233–256.Google Scholar

Konrad, Kai A., and Kovenock, Dan. 2005. Equilibrium and Efficiency in the Tug-of-War. CESifo Working Paper Series 1564. CESifo Group Munich.

Konrad, Kai A., and Kovenock, Dan. 2009. Multi-battle contests. Games and Economic Behavior, 66(1), 256–274.CrossRefGoogle Scholar

Konrad, Kai A., and Kovenock, Dan. 2010. Contests with stochastic abilities. Economic Inquiry, 48(1), 89–103.CrossRefGoogle Scholar

Kooreman, Peter, and Schoonbeek, Lambert. 1997. The specification of the probability functions in Tullock's rent-seeking contest. Economics Letters, 56(1), 59–61.CrossRefGoogle Scholar

Koutsoupias, Elias, and Papadimitriou, Christos. 1999.Worst-case equilibria. Pages 404–413 of: Proceedings of the 16th Annual Conference on Theoretical Aspects of Computer Science. STACS'99. Berlin: Springer-Verlag.Google Scholar

Kreps, David M., and Wilson, Robert. 1982a. Reputation and imperfect information. Journal of Economic Theory, 27(2), 253–279.CrossRefGoogle Scholar

Kreps, David M., and Wilson, Robert. 1982b. Sequential equilibria. Econometrica, 50(4), 863–894.CrossRefGoogle Scholar

Krishna, Vijay. 2002. Auction Theory. New York: Academic Press.Google Scholar

Krishna, Vijay, and Morgan, John. 1997. An analysis of the war of attrition and the all-pay auction. Journal of Economic Theory, 72(2), 343–362.CrossRefGoogle Scholar

Krishna, V., and Morgan, J. 1998. The winner-take-all principle in small tournaments. Advances in Applied Microeconomics, 7, 61–74.Google Scholar

Krishna, Vijay, and Rosenthal, Robert W. 1996. Simultaneous auctions with synergies. Games and Economic Behavior, 17(1), 1–31.CrossRefGoogle Scholar

Krueger, Anne O. 1974. The political economy of the rent-seeking society. American Economic Review, 64(3), 291–303.Google Scholar

Kschischang, F. R., Frey, B. J., and Loeliger, H.-A. 2001. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2), 498–519.CrossRefGoogle Scholar

Kumar, Ravi, and Vassilvitskii, Sergei. 2010. Generalized distances between rankings. Pages 571–580 of: Proceedings of the 19th International Conference on the World Wide Web. WWW ’10. New York: ACM.Google Scholar

Kvasov, Dmitriy. 2007. Contests with limited resources. Journal of Economic Theory, 136(1), 738– 748.CrossRefGoogle Scholar

La, Richard J., and Anantharam, Venkant. 2002. Utility-based rate control in the Internet for elastic traffic. IEEE/ACM Transactions on Networking, 10(2), 272–286.CrossRefGoogle Scholar

Laffont, Jean-Jacques, and Martimort, David. 2001. The Theory of Incentives: The Principal-Agent Model. Princeton, NJ: Princeton University Press.Google Scholar

Laffont, Jean-Jacques, and Robert, Jacques. 1996. Optimal auction with financially constrained buyers. Economics Letters, 52(2), 181–186.CrossRefGoogle Scholar

Lakhani, Karim R., Garvin, David A., and Lonstein, Eric. 2010. TopCoder (A): Developing software through crowdsourcing. Harvard Business School General Management Unit Case No. 610-032.

Langville, Amy N., and Meyer, Carl D. 2004. Deeper inside PageRank. Internet Mathematics, 1(3), 335–380.CrossRefGoogle Scholar

Langville, Amy N., and Meyer, Carl D. 2006. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton, NJ: Princeton University Press.Google Scholar

Langville, Amy N., and Meyer, Carl D. 2012. Who's #1?: The Science of Rating and Ranking. Princeton, NJ: Princeton University Press.Google Scholar

Laoutaris, Nikolaos, Poplawski, Laura J., Rajaraman, Rajmohan, Sundaram, Ravi, and Teng, Shang-Hua. 2008. Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. Pages 165–174 of: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing. PODC ’08.CrossRef

Laslier, J. F. 1997. Tournament Solutions and Majority Voting. Berlin: Springer.CrossRefGoogle Scholar

Laslier, Jean-François. 2002. How two-party competition treats minorities. Review of Economic Design, 7(3), 297–307.CrossRefGoogle Scholar

Laslier, Jean-Francois, and Picard, Nathalie. 2002. Distributive politics and electoral competition. Journal of Economic Theory, 103(1), 106–130.CrossRefGoogle Scholar

Latta, R. B. 1979. Composition rules for probabilities from paired comparisons. Annals of Statistics, 7(2), 349–371.CrossRefGoogle Scholar

Law, Edith, and Ahn, Luis von. 2011. Human computation. Synthesis Lectures on Artificial Intelligence and Machine Learning, 5(3), 1–121.CrossRefGoogle Scholar

Lazear, Edward P., and Rosen, Sherwin. 1981. Rank-order tournaments as optimum labor contracts. Journal of Political Economy, 89(5), 841–864.CrossRefGoogle Scholar

Lee, Tom, and Wilde, Louis L. 1980. Market structure and innovation: A reformulation. Quarterly Journal of Economics, 94(2), 429–436.CrossRefGoogle Scholar

Lehmann, Benny, Lehmann, Daniel, and Nisan, Noam. 2001. Combinatorial auctions with decreasing marginal utilities. Pages 18–28 of: Proceedings of the 3rd ACM Conference on Electronic Commerce. EC ’01. New York: ACM.

Leininger, Wolfgang. 1993. More efficient rent-seeking - A Münchhausen solution. Public Choice, 75(1), 43–62.CrossRefGoogle Scholar

Leme, Renato Paes, Syrgkanis, Vasilis, and Tardos, Éva. 2012. Sequential auctions and externalities. Pages 869–886 of: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’12. SIAM.

Lerner, Josh, and Tirole, Jean. 2002. Some simple economics of open source. Journal of Industrial Economics, 50(2), 197–234.Google Scholar

Levin, Dan, and Ozdenoren, Emre. 2004. Auctions with uncertain numbers of bidders. Journal of Economic Theory, 118(2), 229–251.CrossRefGoogle Scholar

Levitt, Steven D. 1995. Optimal incentive schemes when only the agents’ “Best” output matters to the principal. RAND Journal of Economics, 26(4), 744–760.CrossRefGoogle Scholar

Linster, Bruce G. 1993. Stackelberg rent-seeking. Public Choice, 77(2), 307–321.CrossRefGoogle Scholar

Littlestone, Nick, and Warmuth, Manfred K. 1994. The weighted majority algorithm. Information and Computers, 108(2), 212–261.CrossRefGoogle Scholar

Liu, Qiang, Peng, Jian, and Ihler, Alexander T. 2012. Variational inference for crowdsourcing. Pages 701–709 of: Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Lake Tahoe, Nevada.Google Scholar

Long, Ngo Van, and Vousden, Neil. 1987. Risk-averse rent seeking with shared rents. Economic Journal, 97(388), 971–985.CrossRefGoogle Scholar

Loury, Glenn C. 1979. Market Structure and Innovation. The Quarterly Journal of Economics, 93(3), 395–410.CrossRefGoogle Scholar

Luce, R. Duncan. 1959. Individual Choice Behavior: A Theoretical Analysis. New York: John Wiley & Sons.Google Scholar

Münster, Johannes. 2006. Contests with an unknown number of contestants. Public Choice, 129, 353–368.CrossRefGoogle Scholar

MacKay, David J. C. 2003. Information Theory, Inference, and Learning Algorithms. Cambridge: Cambridge University Press.Google Scholar

Maheswaran, Rajiv T., and Basar, Tamer. 2003. Nash equilibrium and decentralized negotiation in auctioning divisible resources. Group Decision and Negotiation, 12(5), 361–395.CrossRefGoogle Scholar

Mallows, C. L. 1957. Non-null ranking models. Biometrika, 44(1/2), 114–130.CrossRefGoogle Scholar

Malueg, David A., and Yates, Andrew J. 2004. Rent seeking with private values. Public Choice, 119(1/2).CrossRefGoogle Scholar

Marchand, Éric. 2002. On the comparison between standard and random knockout tournaments. The Statistician, 51, 169–178.Google Scholar

Marden, John I. 1995. Analyzing and Modeling Rank Data. Boca Raton, FL: Chapman and Hall.Google Scholar

Marshall, R. C., Meurer, M. J., Richard, J.-F., and Stromquist, W. 1994. Numerical analysis of asymmetric first prize auctions. Games and Economic Behavior, 7(2), 193–220.CrossRefGoogle Scholar

Maschler, Michael, Solan, Eilon, and Zamir, Shmuel. 2013. Game Theory. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Maskin, Eric, and Riley, John. 1984. Optimal auctions with risk averse buyers. Econometrica, 52(6), 1473–1518.CrossRefGoogle Scholar

Maskin, Eric, and Riley, John. 2003. Uniqueness of equilibrium in sealed high-bid auctions. Games and Economic Behavior, 45(2), 395–409.CrossRefGoogle Scholar

Massey. 2013 (November). Massey Ratings, http://masseyratings.com.

Matros, Alexander. 2004. Players with fixed resources in elimination tournaments. Econometric Society 2004 North American Summer Meetings 295. Econometric Society.

Matros, Alexander, and Lai, Ernest K. 2006 (Jan.). Sequential Contests with Ability Revelation. Working Papers 203. University of Pittsburgh, Department of Economics.Google Scholar

Matthews, Steven. 1987. Comparing auctions for risk averse buyers: A buyer's point of view. Econometrica, 55(3), 633–646.CrossRefGoogle Scholar

May, Avner, Chaintreau, Augustin, Korula, Nitish, and Lattanzi, Silvio. 2014. Filter & follow: How social media foster content curation. Pages 43–55 of: Proceedings of the 2014 ACM SIGMETRICS International Conference on Measurement and Modeling Computer Systems, Austin, TX.

Maynard Smith, J. 1974. The theory of games and the evolution of animal conflicts. Journal of Theoretical Biology, 47(1), 209–221.CrossRefGoogle Scholar

Maynard Smith, John. 1982. Evolution and the Theory of Games. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

McAdams, David. 2007. Uniqueness in symmetric first-price auctions with affiliation. Journal of Economic Theory, 136(1), 144–166.CrossRefGoogle Scholar

McAfee, R. Preston. 1993. Mechanism design by competing sellers. Econometrica, 61(6), 1281–1312.CrossRefGoogle Scholar

McAfee, Preston R. 2000. Continuing wars of attrition. Available at SSRN: http://ssrn.com/ abstract=594607 or http://dx.doi.org/10.2139/ssrn.594607.CrossRef

McAfee, R. Preston, and McMillan, John. 1987. Auctions with a stochastic number of bidders. Journal of Economic Theory, 43(1), 1–19.CrossRefGoogle Scholar

McAfee, R. Preston, and Vincent, Daniel. 1993. The declining price anomaly. Journal of Economic Theory, 60(1), 191–212.CrossRefGoogle Scholar

McAfee, R. Preston, and Vincent, Daniel. 1997. Sequentially optimal auctions. Games and Economic Behavior, 18, 246–276.CrossRefGoogle Scholar

McCullagh, Peter. 1980. Regression models for ordinal data. Journal of the Royal Statistical Society B, 42(2), 109–142.Google Scholar

McCullagh, P., and Nelder, J. A. 1989. Generalized Linear Models. 2nd ed. New York: Chapman & Hall.CrossRefGoogle Scholar

McFadden, D. 1973. Conditional logit analysis of qualitative choice behavior. Frontiers in Econometrics, Academic Press: New York, 105–142.Google Scholar

McKinsey & Company. 2009. And the winner is…, http://mckinseyonsociety.com/downloads/ reports/Social-Innovation/And the winner is.pdf.

McManus, M. 1962. Numbers and size in Cournot oligopoly. Bulletin of Economic Research, 14.CrossRefGoogle Scholar

McManus, M. 1964. Equilibrium, numbers and size in Cournot oligopoly. Bulletin of Economic Research, 16(2), 68–75.CrossRefGoogle Scholar

McSherry, Frank, and Najork, Marc. 2008. Computing information retrieval performance measures efficiently in the presence of tied scores. Pages 414–421 of: Macdonald, Craig, Ounis, Iadh, Plachouras, Vassilis, Ruthven, Ian, and White, RyenW. (eds), Advances in Information Retrieval. Lecture Notes in Computer Science, vol. 4956. Berlin: Springer.CrossRefGoogle Scholar

Mease, David. 2003. A penalized maximum likelihood approach for the ranking of college football teams independent of victory margins. The American Statistician, 57(4), 241–248.CrossRefGoogle Scholar

Merton, Robert K. 1968. The Matthew effect in science: The reward and communication systems of science are considered. Science, 159(3810), 56–63.CrossRefGoogle Scholar

Merton, Robert K. 1973. The Sociology of Science: Theoretical and Empirical Investigations. Chicago: University of Chicago Press.Google Scholar

Michaels, Robert. 1988. The design of rent-seeking competitions. Public Choice, 56(1), 17–29.CrossRefGoogle Scholar

Milgrom, Paul. 1999. The Envelope Theorems, Stanford: Stanford University Press.Google Scholar

Milgrom, Paul. 2004. Putting Auction Theory to Work. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Milgrom, Paul, and Segal, Ilya. 2002. Envelope theorems for arbitrary choice sets. Econometrics, 70(2), 583–601.Google Scholar

Milgrom, P., and Weber, R. 1983. A theory of auctions and competitive bidding. Tech. Rep. 5. Northwestern University.Google Scholar

Millner, Edward L., and Pratt, Michael D. 1991. Risk aversion and rent-seeking: An extension and some experimental evidence. Public Choice, 69(1), 81–92.CrossRefGoogle Scholar

Mimno, David, and McCallum, Andrew. 2007. Expertise modeling for matching papers with reviewers. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’07, New York, NY.Google Scholar

Minc, Henryk. 1988. Nonnegative Matrices. New York: John Wiley & Sons.Google Scholar

Minka, Thomas. 2001. Expectation propagation for approximate Bayesian inference. Pages 362– 369 of: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, Seattle, WA.Google Scholar

Mirrokni, Vahab S., Muthukrishnan, Muthu, and Nadav, Uri. 2010. Quasi-proportional mechanisms: Prior-free revenue maximization. In: Proceedings of the 9th Latin American Theoretical Informatics Symposium. LATIN'2010.

Mo, Jeonghoon, and Walrand, Jean. 2000. Fair end-to-end window-based congestion control. IEEE Transactions on Networking, 8(5), 556–567.CrossRefGoogle Scholar

Moldovanu, Benny, and Sela, Aner. 2001. The optimal allocation of prizes in contests. American Economic Review, 91(3), 542–558.CrossRefGoogle Scholar

Moldovanu, Benny, and Sela, Aner. 2006. Contest architecture. Journal of Economic Theory, 126(1), 70–97.CrossRefGoogle Scholar

Moldovanu, Benny, Sela, Aner, and Shi, Xianwen. 2007. Contests for status. Journal of Political Economy, 115(2), 338–363.CrossRefGoogle Scholar

Moldovanu, Benny, Sela, Aner, and Shi, Xianwen. 2008. Competing auctions with endogenous quantities. Journal of Economic Theory, 141(1), 1–27.CrossRefGoogle Scholar

Moldovanu, Benny, Sela, Aner, and Shi, Xianwen. 2012. Carrots and sticks: Prizes and punishments in contests. Economic Inquiry, 50(2), 453–462.CrossRefGoogle Scholar