Bibliography

[Ake95] George Akerlof. The market for lemons: Quality uncertainty and the market mechanism. In Essential Readings in Economics, pages 175–188. Springer, New York, N.Y., 1995.

[ADK${}^{+}$08] Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva Tardos, Tom Wexler, and Tim Roughgarden. The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4):1602–1623, 2008.

[Arr50] Kenneth J. Arrow. A difficulty in the concept of social welfare. The Journal of Political Economy, pages 328–346, 1950.

[Aum76] R. J. Aumann. Agreeing to disagree. Annals of Statistics, 4(6):1236–1239, 1976.

[AB95] R. J. Aumann and A. Brandenburger. Epistemic conditions for Nash equilibrium. Econometrica, 63(5):1161–1180, 1995.

[Ban92] Abhijit V. Banerjee. A simple model of herd behavior. The Quarterly Journal of Economics, pages 797–817, 1992.

[BA99] Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.

[BP90] Salvador Barbera and Bezalel Peleg. Strategy-proof voting schemes with continuous preferences. Social Choice and Welfare, 7(1):31–38, 1990.

[Bas94] Kaushik Basu. The Traveler’s Dilemma: Paradoxes of rationality in game theory. The American Economic Review, 84(2):391–395, 1994.

[Bla48] Duncan Black. On the rationale of group decision-making. Journal of Political Economy, 56(1):23–34, 1948.

[Bol84] Béla Bollobás. The evolution of random graphs. Transactions of the American Mathematical Society, 286(1):257–274, 1984.

[Bra68] Dietrich Braess. Über ein paradoxon aus der verkehrsplanung. Mathematical Methods of Operations Research, 12(1):258–268, 1968.

[CGGH99] M. Capra, J. K. Goeree, R. Gomez, and C. A. Holt. Anamolous behavior in a traveler’s dilemma. American Economic Review, 89(3):678–690, 1999.

[CIL12] Shuchi Chawla, Nicole Immorlica, and Brendan Lucier. On the limits of black-box reductions in mechanism design. In Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, pages 435–448. ACM, 2012.

[CMP16] Jing Chen, Silvio Micali, and Rafael Pass. Tight revenue bounds with possibilistic beliefs and level-k rationality. Econometrica, 83(4):1619–1639, 2016.

[Che52] Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, pages 493–507, 1952.

[Cla71] Edward H. Clarke. Multipart pricing of public goods. Public Choice, 11(1):17–33, 1971.

[CY92] K. S. Cook and T. Yamagishi. Power in exchange networks: A power-dependence formulation. Social Networks, 14:245–265, 1992.

[CLRS09] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, Cambridge, Mass., 2009.

[DGS86] Gabrielle Demange, David Gale, and Marilda Sotomayor. Multi-item auctions. The Journal of Political Economy, 94:863–872, 1986.

[DF81] Lester E. Dubins and David A. Freedman. Machiavelli and the Gale-Shapley algorithm. The American Mathematical Monthly, 88(7):485–494, 1981.

[EK10] David Easley and Jon Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge, 2010.

[EOS07] Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. The American Economic Review, 97(1):242–259, 2007.

[EK72] Jack Edmonds and Richard M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248–264, 1972.

[ER59] Paul Erdős and Alfréd Rényi. On random graphs. Publicationes Mathematicae Debrecen, 6:290–297, 1959.

[FHMV95] R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. MIT Press, Cambridge, Mass., 1995.

[FF62] L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.

[GS62] David Gale and Lloyd S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9–15, 1962.

[GS85] David Gale and Marilda Sotomayor. Some remarks on the stable matching problem. Discrete Applied Mathematics, 11(3):223–232, 1985.

[Gal07] Francis Galton. Vox populi. Nature, 75(1949):450–451, 1907.

[Gib73] Allan Gibbard. Manipulation of voting schemes: a general result. Econometrica, 4(1):587–601, 1973.

[Gib77] Allan Gibbard. Manipulation of schemes that mix voting with chance. Econometrica, 45(3):665–681, 1977.

[Gil59] Donald B. Gillies. Solutions to general non-zero-sum games. Contributions to the Theory of Games, 4(40):47–85, 1959.

[Gro73] Theodore Groves. Incentives in teams. Econometrica, 41(4):617–631, 1973.

[Hal35] P. Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26–30, 1935.

[HM90] J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549–587, 1990.

[HP09] J. Y. Halpern and R. Pass. A logical characterization of iterated admissibility. In Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, pages 146–155, 2009.

[HP10] Joseph Y. Halpern and Rafael Pass. Game theory with costly computation. In Proc. of the First Symposium on Innovations in Computer Science, pages 120–142, 2010.

[Hin62] J. Hintikka. Knowledge and Belief . Cornell University Press, Ithaca, N.Y., 1962.

[Hoe63] Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13–30, 1963.

[Hur60] Leonid Hurwicz. Optimality and informational efficiency in resource allocation processes. In K. J. Arrow, S. Karlin, and P. Suppes, editors, Mathematical Methods in the Social Sciences, pages 27–46. Stanford University Press, Stanford, Calif., 1960.

[HZ79] Aanund Hylland and Richard Zeckhauser. The efficient allocation of individuals to positions. Journal of Political Economy, 87(2):293–314, 1979.

[KS85] Michael L. Katz and Carl Shapiro. Network externalities, competition, and compatibility. The American Economic Review, 75(3):424–440, 1985.

[KKT03] David Kempe, Jon Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 137–146. ACM, 2003.

[KT05] Jon Kleinberg and Éva Tardos. Algorithm Design. Addison-Wesley Longman Publishing Co., Inc., Boston, Mass., 2005.

[KT08] Jon Kleinberg and Éva Tardos. Balanced outcomes in social exchange networks. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pages 295–304. ACM, 2008.

[Kle99] Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604–632, 1999.

[Kle00] Jon M. Kleinberg. Navigation in a small world. Nature, 406:845–845, 2000.

[KP09] Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. Computer Science Review, 3(2):65–69, 2009.

[Kri59] S. Kripke. A completeness theorem in modal logic. Journal of Symbolic Logic, 24:1–14, 1959.

[LLP15] Samantha Leung, Edward Lui, and Rafael Pass. Voting with coarse beliefs. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pages 61–61. ACM, 2015.

[Lit53] J. E. Littlewood. A Mathematician’s Miscellany. Methuen, 1953.

[MR18] Dan Margalit and Joseph Rabinoff. Interactive Linear Algebra. Georgia Institute of Technology, 2018.

[McL11] Andrew McLennan. Manipulation in elections with uncertain preferences. Journal of Mathematical Economics, 47(3):370–375, 2011.

[MS82] Paul Milgrom and Nancy Stokey. Information, trade and common knowledge. Journal of Economic Theory, 26(1):17–27, 1982.

[MS96] Dov Monderer and Lloyd S. Shapley. Potential games. Games and Economic Behavior, 14(1):124–143, 1996.

[MKA14] Carey K. Morewedge, Tamar Krishnamurti, and Dan Ariely. Focused on fairness: Alcohol intoxication increases the costly rejection of inequitable rewards. Journal of Experimental Social Psychology, 50:15–20, 2014.

[MP16] Andrew Morgan and Rafael Pass. The price of stability in networked coordination games. In preparation, 2016.

[Mor00] Stephen Morris. Contagion. The Review of Economic Studies, 67(1):57–78, 2000.

[Mye81] Roger B. Myerson. Optimal auction design. Mathematics of Operations Research, 6(1):58–73, 1981.

[Nas50a] J. Nash. The bargaining problem. Econometrica, 18:155–162, 1950.

[Nas50b] J. Nash. Equilibrium points in $n$-person games. Proceedings of the National Academy of Sciences, 36:48–49, 1950.

[NR99] Noam Nisan and Amir Ronen. Algorithmic mechanism design. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pages 129–140. ACM, 1999.

[NRTV07] Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani. Algorithmic Game Theory, volume 1. Cambridge University Press, Cambridge, 2007.

[OR94] Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, Cambridge, Mass., 1994.

[PBMW98] L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. In Proceedings of the 7th International World Wide Web Conference, pages 161–172, Brisbane, Australia, 1998.

[PS14] Rafael Pass and Karn Seth. On the impossibility of black-box transformations in mechanism design. In Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30–October 2, 2014, Proceedings, volume 8768, page 279. Springer, 2014.

[Roc84] Sharon C. Rochford. Symmetrically pairwise-bargained allocations in an assignment market. Journal of Economic Theory, 34(2):262–281, 1984.

[Ros73] R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65–67, 1973.

[Rot82] Alvin E. Roth. The economics of matching: Stability and incentives. Mathematics of Operations Research, 7(4):617–628, 1982.

[RS92] Alvin E. Roth and Marilda A. Oliveira Sotomayor. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, Cambridge, 1992.

[RT02] Tim Roughgarden and Éva Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236–259, 2002.

[SS81] Mark A. Satterthwaite and Hugo Sonnenschein. Strategy-proof allocation mechanisms at differentiable points. The Review of Economic Studies, 48(4):587–597, 1981.

[Sat75] Mark Allen Satterthwaite. Strategy-proofness and arrow’s conditions: Existence and correspondence theorems for voting procedures and social we lfare functions. Journal of Economic Theory, 10(2):187–217, 1975.

[SM03] Andreas S. Schulz and Nicolás E. Stier Moses. On the performance of user equilibria in traffic networks. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 86–87. ACM, 2003.

[SV13] Carl Shapiro and Hal R. Varian. Information Rules: A Strategic Guide to the Network Economy. Harvard Business Press, 2013.

[SS74] Lloyd Shapley and Herbert Scarf. On cores and indivisibility. Journal of Mathematical Economics, 1(1):23–37, 1974.

[Spe73] Michael Spence. Job market signaling. The Quarterly Journal of Economics, pages 355–374, 1973.

[Sur05] James Surowiecki. The Wisdom of Crowds. Anchor, 2005.

[Sve99] Lars-Gunnar Svensson. Strategy-proof allocation of indivisible goods. Social Choice and Welfare, 16(4):557–567, 1999.

[SR14] Lars-Gunnar Svensson and Alexander Reffgen. The proof of the Gibbard–Satterthwaite theorem revisited. Journal of Mathematical Economics, 55:11–14, 2014.

[TW88] T. C.-C. Tan and S. R. da C. Werlang. The Bayesian foundation of solution concepts of games. Journal of Economic Theory, 45:370–391, 1988.

[Vic61] William Vickrey. Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance, 16(1):8–37, 1961.

[von28] J. von Neumann. Zur theorie der gesellschaftsspiele. Mathematische annalen, 100(1):295–320, 1928.

[vM47] J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, Princeton, N.J., 2nd edition, 1947.

[Wal54] Leon Walras. Elements of Pure Economics, or The Theory of Social Wealth. Published for the American Economic Association and the Royal Economic Society by Allen and Unwin London, 1954.

[WS98] Duncan J. Watts and Steven H. Strogatz. Collective dynamics of small-world networks. Nature, 393(6684):440–442, 1998.

[Wil99] D. Willer. Network Exchange Theory. Praeger, 1999.

[You02] H. Peyton Young. The diffusion of innovations in social networks. Santa Fe Institute Working Paper 02-04-018, 2002.