Home
Publication
Teaching
Teoria de juegos

Novedades

  • Recuperatorio del parcial el jueves 7 de diciembre a las 13h (escrito 5h - cualquier documentacion autorizada). En mi oficina (dpto de matematica a mitad de pasillo)
  • Cambie unos coeficientes en la matriz grande del ej3 practica 3.
  • fecha del parcial: martes 7 de noviembre.
  • Esta disponible la práctica 3.
  • Esta disponible la práctica 2.
  • Esta disponible la práctica 1.
  • La 1era clase es el martes 22 a las 14h en el aula 4 del pab.1.

Informaciones generales

Correlatividades

  • para matemáticos: Cálculo Avanzado
  • para computadores: Probabilidades y Estadística (C)

Programa

  • Juegos Combinatorios: Definición. Imparcial vs. partisano; normal vs. misere. Posiciones P y N. Representación en grafos. Teorema de Zermelo. Juegos de Nim (suma de Nim y Teorema de Bouton), Función de Sprague-Grundy, Teorema de Sprague-Grundy.
  • Juegos de suma cero: Definición, forma normal, Estrategias mixtas, Niveles de seguridad, estrategias dominadas, Teorema Minimax de von Neumann, forma extensiva (arbol de Kuhn, conjuntos de informacion, equilibrios perfectos en sub-juegos, estrategias de comportamientos y mixtas, teorema de Kuhn), juegos con espacios de estrategia [0,1], juegos estocasticos (teo de Shapley),
  • Teoría no cooperativa: forma estratégica y forma extensiva, Equilibrio de Nash (definicion y existencia), estrategias dominadas, principio de indiferencia, juegos simetricos, modelos de duopolio de Cournot y Stackelberg.
  • Juegos evolutivos: estrategia evolutivamente estable, dinamica del replicador.
  • Juegos potenciales, juegos de congestion, precio de la anarquia en "selfish routing game".
  • Teoría de subastas: estrategias para apostar en las subastas de 1era y 2nda oferta selladas, subastas con precio de reserva, Teorema de equivalencia de ingresos para valuaciones iid, Teorema de Myerson.

Importante

Se recuerda que es obligatorio leer las normas de higiene y seguridad.

Régimen de promoción

Para firmar los trabajos prácticos se debe aprobar el examen parcial. Habrá una fecha de recuperación al final del cuatrimestre.

Videos introductivos

Horarios y aulas

  • Teórica: martes y jueves de 15h a 17h en el aula 4 del pab. 1
  • Práctica: martes y jueves de 14h a 15h en el aula 4 del pab. 1

Bibliografía

Práctica

Posibles temas de final

  • Cualquier capitulo del libro Algrithmic game theory de N. Nisam, T. Roughgarden, E. Tardos, V. Vazirani.
  • D.T. Bishop, C. Cannings, A generalized war of attrition , J. Theoretical Biology, 70 (1), 1978, 85-124.
  • K. Chatterjee, J.G. Reiter, M.A. Nowak, Evolutionnary dynamics of biological auctions , Theoretical population biology, 81, 2012, 69-80.
  • M Babaioff, R Kleinberg, CH Papadimitriou, Congestion games with malicious players , Proceedings of the 8th ACM conference on Electronic commerce, 2007, 103-112.
  • T. Moscibroda, S. Schmid, R- Wattenhofer, When selfish meets evil: Bysantine players in a virus inoculation game , Proceeding PODC '06 Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, 35-44.
  • W.H. Sandholm, Potential Games with Continuous Player Sets., J. Economic theory, 97 (1), 2001, 81-108.
  • J. Haofbauer, K. Sigmund, Evolutionnary game dynamics , Bull. AMS, 40 (4), 479-519, 2003.
  • J. Miekiscz, Evolutionnary game theory and population dynamics 2008.
  • P. Cardaliaguet, Introducton to differential games
  • T. Plambeck, A. Siegel, "Misere quotients for impartial games", J. of Combinatorial Theory, Series A (2008) 593-622.
  • H. Tembine, "Population games with networking applications", PhD thesis, 2009.
  • A. Guo, E. Miller, "Lattice point methods for combinatorial games" arXiv:09083473 (Erratum arXiv:1105.5420).
  • O. Gueant, "Mean field games and applications to economics" Ph.D. thesis 2010.
  • A. Lachapelle, "Control and Transport Problems in Economics: Theoretical and Numerical Aspects", Ph.D. theses 2010.
  • F. Stewart, "Scoring play combinatorial games", Ph.D. thesis, 2011.
  • R. Morrison, E. Friedman, A. Landsberg, "Combinatorial Games with a Pass: A dynamical systems approach" arXiv:1204.3222
  • P. Cardialiguet, Notes on Mean Field Games" 2012.
  • M. Harju, "On probabilities of risk type board game combats" arXiv:math/1204.4082v1
  • E. Ianovski, Cake Cutting Mechanisms" Univ. of Auckland thesis, BSc Logic and Comp. 2012 arXiv:1203.0100
  • Aprendizaje (A. Blum, Y. Mansour, "Learning, regret minimization and equilibria").[Comp]
  • Bayesianos: antes de un duelo, desayunar con un whisky o con un actimel? (Kockesen p. 117; ver S. Zamir, "Bayesian Games: Games with Incomplete Information", Discussion paper 486 (2008)).
  • F. Maccheroni, M. Marinacci, "How to cut a pizza fairly". Social Welfare 20 (2003) 457-465).
  • A. Galeotti, S. Goyal, M. Jackson, F. Vega-Redondo, L. Yariv, "Network games" 2008
  • Heladeros en la playa (Hotelling) y la tragedia de los comunes. R. E. Marks, "Competition and common property", AGSM Working Paper 98-003 (1998).
  • M. Jackson, "A Survey of Models of Network Formation: Stability and Efficiency" (2003).
  • Monderer and Shapley, Potential games , Games and Economic Behavior 14 (1996), 124-143).
  • Juegos repetidos con descuento y teoremas Folk (Ratliff; Kockesen p. 104; ver J. Benoit, V. Krishna, "The Folk Theorems for Repeated Games: A Synthesis").
  • Juegos simetricos, invariantes por las accion de un grupo (apunte de Ferguson).[Algebra]
  • S. Morris, H. Song Shin, "Global Games: Theory and Applications", (2001).
  • Poker de Borel y de von Neumann. All in players (Ferguson; ver R. Bellman, "On games involving bluffing", Rend. Circolo Mat. Palermo 1 (1952) 139-156.).
  • Stripped-down Poker (Reiley, Urbancic, Walker; Senalizacion, Bluff).
  • Subastas (Binmore, Playing for Real; L. Kockesen p. 46 y p.73; ver M. Chwe, "The discrete bid first auction", Econ. Lett. 31 (1989) 303-306.).
  • A. Neyman, "From Markov Chains to Stochastic Games", "Stochastic Games: the Existence of the Minimax".[Proba]
  • R. Myerson, "Fundamentals of Social Choice Theory", Discussion paper no. 1162 (1996) Northwestern Univ.

    • Primera fuerte:
    1. G. Akerlof, "Social Distance and Social Decisions", Econometrica 65 (1997) 1005-1027.
    2. S. Alpern, "The telephone coordination game", 2000.
    3. S. Alpern, "Assymetric Rendezvous Search on the Circle", 1999.
    4. O. Amantier, "Does observation influence learning?", Games and Economic Behavior 46 (2004) 221-239.[Prof]
    5. R. Aumann, L. Shapley, "Long Term Competition-A Game Theoretic Analysis", UCLA Working Papers 676 (1992) 1-27.
    6. M. Chwe, "Why were workers whipped? Pain in a principal-agent model", The Economic Journal 100 (1990) 1109-1121.[Prof; trabajo infantil y esclavitud]
    7. M. Dreef, P. Borm, B. van der Genugten, "Measuring Skill in Games: Several Approaches Discussed", (2003)
    8. P. Dubey, J. Geanakoplos, "Grading Exams: 100, 99, 98,... or A, B, C?", [Prof]
    9. I. Eshel, "On a Prey-Predator Nonzero-Sum Game and the Evolution of Gregarious Behavior of Evasive Prey", The American Naturalist 112 (1978) 787-795.[ode]
    10. A. Fraenkel, "The Raleigh game" INTEGERS, Electr. J. Combinat. Number Theory 7(2007) 1-11.[Algebra1]
    11. A. Fraenkel, "Euclid and Wythoff games", Discrete Math. 304 (2005) 65-68.
    12. A. Fraenkel, A. Kontorovich, "The Sierpinski sieve of Nim-varieties and binomial coefficients", INTEGERS, Electr. J. Combinat. Number Theory 7 (2007) 1-19.
    13. L. Luthi, E. Pestelacci, M. Tomassini, "Evolutionary Dilemmas in a Social Network", Advances in Artificial Life (2007) 545-554 (ver "Social dilemmas and cooperation in complex networks").
    14. R. Myerson, "Graphs and cooperation in games", Math. of Oper. Research, 2 (1977) 225-229.[Aplicada/Comp]
    15. A. Neyman, "Stochastic Games and Nonexpansive Maps" [Funcional].
    16. G. Oshanina, O. Vasilyevc, P. L. Krapivskye and J. Klafterf, "Survival of an evasive prey", Proc. Nat. Acad. Sci. 106 (2009) 13696-13701.[ode]
    17. S. Pinker, M. Nowak, J. Lee, "The logic of indirect speech" PNAS 105 (2008) 833-838.[GRAL]
    18. D. Ridley, "Herding versus Hotelling: Market Entry with Costly Information", 2008.
    19. S. Sahi, M. Shubik "A Model of a Sudden-Death Field-Goal Football Game as a Sequential Duel". Math. Social Sci. 15 (1988) 205-215.
    20. T. Schelling, "Dynamic Models of Segregation", J. of Math. Sociology 1 (1971) 143-186.
    21. C. Schulze, D. Stauffer, S. Wichmann, "Birth, survival and death of languages by Monte Carlo simulation", 2007 (ver Stauffer, "Opinion Dynamics and Sociophysics").
    22. L. Shapley, J. Palamara, "Simple Games and Authority Structure", UCLA Working Paper 796 (2000) 1-23.
    23. M. Shayo, A. Harel, "Non-Consequentialist Voting" 2010.
    24. J. Tallon, S. Zamir, J. Vergnaud, "Contradicting Beliefs and Communication".

    Maestro:
    1. K. Arrow, "Discounting, Morality, and Gaming", en "Discounting and intergenerational equity", P. Portney, J. Weyant.
    2. G. Asheim, M. Dufwenberg, "Deductive Reasoning in Extensive Games", The Economic Journal 113 (2003) 305-325.
    3. R. Aumann, J. Dreze, "When All is Said and Done, How Should You Play and What Should You Expect?", Discussion Paper Series (2005).
    4. R. Aumann, W. Gueth, "Species Survival and Evolutionary Stability in Sustainable Habitats", Journal of Evolutionary Economics 10 (2000) 437-447.
    5. R. Aumann, S. Hart, "Long Cheap Talk", Econometrica 71 (2003) 1619-1660
    6. R. Aumann, "Correlated Equilibrium as an Expression of Bayesian Rationality", Econometrica 55 (1987) 1-18.
    7. R. Aumann, S. Hart and M. Perry, "The Absent-Minded Driver", Games and Economic Behavior 20 (1997) 102-116 y "The Forgetful Passenger", Games and Economic Behavior 20 (1997) 117-120 (ver M Piccione, A. Rubinstein, "The Absent-Minded Driver s Paradox: Synthesis and Responses" Games and Econ. Behavior 20 (1997) 121-130).
    8. R. Aumann, "Subjectivity and Correlation in Randomized Strategies," Journal of Mathematical Economics 1 (1974), pp. 67-96.
    9. S. Baliga, T. Sjostrom, "The Strategy of Manipulating Conflict" 2009.
    10. A. Berentsen, E Brugger, S. Lortscher, "On Cheating and Whistle-Blowing", (2003)
    11. D. Berga, G. Bergantinos, J. Masso, A. Neme, "On exiting after voting", Int. J. Game Theory 34 (2006) 33-54 (ver "Stability...".
    12. A. Blum, M. Hajiaghayi, K. Ligett, A. Roth, "Regret minimization and the price of total anarchy", Proc. 40th ACM symposium on Theory of Computing 2008.[Comp]
    13. B. Bollobas, I. Leader, M. Walters, "Lion and Man - Can Both Win?", Preprint 2009.[Avanzado]
    14. P. Borm, H. Hamers, R. Hendrickx, "Operations Research Games: A Survey", TOP 9 (2001) 139-199. [Aplicada/Comp]
    15. Y. Bramoulle, R. Kranton, M. D'Amours, "Strategic Interaction and Networks" (2010)
    16. S. Brykalov, "A Game with Program Control and Variable Terminal Moment", Int. Report (1999) 1-10.[ode]
    17. A. Casella, T. Palfrey and R. Riezman, "Minorities and Storable Votes", Quarterly Journal of Political Science 3 (2008) 165-200.
    18. J. Cesco, A. Cali, "Una solucion dinamica para juegos con utilidades transferibles", Preprint 2005.
    19. D. Cherkashin, J.D. Farmer, S. Lloyd, "The reality game", J. of Economic Dynamics and Control 33 (2009) 1091-1105.
    20. G. Chichilnisky, "The Topology of Fear", Preprint 2009.[Topol]
    21. S. Chowdhury, R. Sheremeta, "A generalized Tullock contest" Public Choice, to appear.
    22. P. Dal Bo, "Three Essays on Repeated Games", primer capitulo. Ph.D. Thesis UCLA 2002.
    23. P. Dubey and L. Shapley, "Noncooperative general exchange with a continuum of traders: Two models", J. of Mathematical Economics Volume 23 (1994) 253-293.
    24. E. Duchene, A.S. Fraenkel, S. Gravier and R.J. Nowakowski, Another bridge between Nim and Wythoff, Australasian J. of Combinatorics 44 (2009), 43-56.
    25. U. Dulleck, "The E-Mail Game Revisited - Modeling Rough Inductive Reasoning" 2002.
    26. A. Dydejczyk, K. Kulakowski, M. Rybak, "The norm game - how a norm fails", Computational Science, ICCS 2009 (2009) 835-844.[Comp]
    27. N. Elkies, "Higher Nimbers in pawn endgames on large chessboards", More Games of No Chance, Berkeley, 2002, 1-21 (ver "On numbers and endgames: Combinatorial game theory in chess endgames").
    28. J. Ely, "Kludgeg" 2007.
    29. B. Engelhardt, "Crime Networks with Bargaining and Build Frictions" 2008.
    30. L. Epstein, M. Marinacci, "The Core of Large Differentiable TU Games", Journal of Economic Theory 100 (2001) 235-273.
    31. N. Feltovich, R. Harbaugh, T. To, "Too Cool for School? Signalling and Countersignalling", The RAND Journal of Economics 33 (2002), 630-649. [Prof]
    32. T. Ferguson, "Who solved the secretary problem?" Statistical Science 4 (1989) 282-289 (ver E Samuel-Cahn, "When Should You Stop and what do You Get? Some Secretary Problems", The Hebrew University of Jerusalem, Preprint 2005.
    33. A. Fraenkel, "New games related to old and new sequences", INTEGERS, Electronic J. Combinat. Number Theory 4 (2004) 1-18.
    34. A. Fraenkel, "Arrays, numeration systems and Frankenstein games", Theoretical Computer Sci. 282 (2002) 271-284.
    35. A. Fraenkel, "Multivision: a game of arbitrarily long play", Amer. Math. Monthly 105 (1998) 923-928.
    36. M. Francesconi, C. Ghiglino, M. Perry,, "On The Origin Of The Family" 2010
    37. E. Friedgut, G. Kalai, N. Nisan, "Elections Can be Manipulated Often", Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium.[Comp]
    38. D. Fudenberg, D. Levine, "Self Control, Risk Aversion, and the Allais Paradox"
    39. P. Gadea-Blanco, J. Jimenez-Gomez, M. Marco-Gil, "Some game-theoretic grounds for meeting people half-way", Preprint 2010.
    40. A. Gibbard, "Manipulation of voting schemes", Econometrica 41 (1973) 587-601 (ver A. Feldman, "Manipulating voting procedures").
    41. Z. Gorodeisky, "Stability of Mixed Equilibria", Games and Econ. Behavior 66 (2009) 191-201.
    42. O. Gossner, P. Hernandez, A. Neyman. "Online matching pennies", Preprint 2003.[Comp]
    43. S. Hart, "Evolutionary Dynamics and Backward Induction", Games and Economic Behavior 41 (2002) 227-264.
    44. S. Hart, "A Comparison of Non-Transferable Utility Values", Theory and Decision 56 (2004) 35-46.
    45. S. Hart, "Discrete Colonel Blotto and General Lotto games" Int J Game Theory 36 (2008) 441-460 (ver Errata).
    46. S. Hart, A. Mas-Colell, "A General Class of Adaptive Strategies", Journal of Economic Theory 98 (2001) 26-54.
    47. P. Herings, G. van der Laan, D. Talman, "Cooperative games in graph structure", 2000.
    48. J. Horner, D. Rosenberg, E. Solan, N. Vieille, "On a Markov Game with One-Sided Information", Operations Research 58 (2010) 1107-1115.
    49. M. Iyigun, "Marriage, Cohabitation and Commitment", 2009.
    50. A. Kalai, E. Kalai, "A Cooperative Value for Bayesian Games", The Hebrew University of Jerusalem, Preprint 2009.
    51. V. Krishna, J. Morgan, "On the Benefits of Costly Voting", Economic Working Papers 0083 (2008), Int. Adv. Study, Princeton.
    52. D. Levine, "The Castle on the Hill", Review of Economic Dynamics 3 (2000) 330-337.
    53. R. Martinez, J. Masso, A. Neme, J. Oviedo, "An Algorithm to Compute the Full Set of Many-To-Many Stable Matchings", Mathematical Social Sciences 47 (2004) 187-210.
    54. J. McKenzie Alexander, "Random Boolean Networks and Evolutionary Game Theory", Philosophy of Science 70 (2002) 1289-1304.
    55. F. Menezes, P. Monteiro, "Corruption and Auctions", J. of Math. Econ. 42 (2006) 97-108.
    56. R. Myerson, "Cooperative games with incomplete information", Differential Information Economies 19 (2005) 481-505.
    57. R. Myerson, "Effectiveness of Electoral Systems for Reducing Government Corruption: A Game Theoretic Analysis" (1993.
    58. R. Myerson, G. Pollock and J. Swinkels, "Viscous Population Equilibria", Games and Economic Behavior 3 (1991) 101-109.
    59. R. Myerson, "Axiomatic Foundations of Bayesian Decision Theory", Discussion paper no. 671 (1986)
    60. A. Neyman, "Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoners' Dilemma", Econ. Letters 19 (1985) 227-229 (buscar paper con las demostraciones).[Comp]
    61. R. Pancs, N. Vriend, "Schellings Spatial Proximity Model of Segregation Revisited", Journal of Public Economics 91 (2007) 1-24.
    62. R. Peeters, J Potters, "Sender-Receiver Games", Tilburg University, Discussion Paper 1999-46.[Comp]
    63. T. Quint and M. Shubik, "A Bound on the Number of Nash Equilibria in a Coordination Game", Economics Letters 77 (2002) 323-327 (ver "A theorem on the number of Nash equilibria in a bimatrix game", Int. J. of Game Theory 26 (1997) 353-359)
    64. T. Quint and M. Shubik, "A model of migration", Yale School of Management Working Papers (1994).
    65. T. Quint, M. Shubik and D. Yan, "Dumb Bugs and Bright Noncooperative Players: Games, Context and Behavior", Cowles Foundation Discussion Papers 1094, Yale University
    66. J. Renault, S. Scarlatti, M. Scarsini, "A Folk Theorem for Minority Games", 2003.
    67. P. Reny, "Arrow's Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", Econ. Letters 70 (2001) 99-105.
    68. T. Roughgarden, "Computing equilibria: a computational complexity perspective", Economic Theory, 42 (2010) 193-236.[Comp]
    69. A. Roth, "The Price of Malice in Linear Congestion Games", Internet and Network Economics, Lect. Notes in Comp. Sci. 5385 (2008) 118-125.[Comp]
    70. R. Sethi and M. Yildiz, "Public disagreement", Economic Working Papers 0089 (2009), Int. Adv. Study, Princeton.
    71. J. Shalev, "Loss Aversion equilibria", Int. J. of Game Theory 29 (2000) 269-287 (ver "Loss Aversion in Repeated Games", "Loss Aversion and bargaining".
    72. L. Shapley and M. Shubik, "On Market Games", J. of Economic Theory 1 (1969) 9-25.
    73. E. Shmaya, "The determinacy of infinite games with eventual perfect monitoring", Preprint 2009.
    74. M. Shubik, M. Sobel, "Stochastic Games, Oligopoly Theory and Competitive Resource Allocation", Cowles Foundation Discussion Papers 525, Yale University (1979).
    75. C. Tarnita, H. Ohtsuki, T. Antal, Feng Fu, M. Nowak, "Strategy selection in structured populations", J. of Theoretical Biology 259 (2009) 570-581 (ver "Evolutionary dynamics in set structured populations", PNAS).
    76. Y. Tauman, A. Zapechelnyuk, "Bargaining with a Bureaucrat", The Hebrew University of Jerusalem, Preprint 2006.[GRAL]
    77. J. Taylor, "Dependence of the Parity-Condition Parameter on the Combat-Intensity Parameter for Lanchester-Type Equations of Modern Warfare", OR Spektrum 1 (1980) 199-205.[ode]
    78. D. Wolpert, J. Bono, "Game Mining: How to make money from those about to play a game", Preprint 2009. :-)
    79. Zhengzheng Pan, "Learning, Game Play, and Convergence of Behavior in Evolving Social Networks", Ph.D. Thesis, 2009 (parcial, Cap 2 uno, Cap 4 otro). [Comp]

    Gran Maestro:
    1. T. Adamo, A. Matros, "A Blotto Game with Imperfect Information", 2008.
    2. A. Akhmetzhanov, F. Grognard, L. Mailleret, P. Bernhard, "Join forces or cheat: evolutionary analysis of a consumer-resource system", Rapport de Recherche INRIA 7312 (2010) (ver "consumers facing cheating mutants").
    3. P. Amoros, "Picking the Winners" 2010.
    4. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, T. Roughgarden, "The Price of Stability for Network Design with Fair Cost Allocation", Found. of Comp. Sci., 45th Annual IEEE Symposium (2004) 295.304.[Comp]
    5. I. Arieli, "Backward Induction and Common Strong Belief of Rationality", en "New Perspectives on Games and Interaction", K. Apt, R. Van Rooij.
    6. R. Aumann, "Values of Markets with a Continuum of Traders", Econometrica 43 (1975) 611-646.[Funcional]
    7. Y. Babichenko, "Uncoupled Automata and Pure Nash Equilibria", International Journal of Game Theory 39 (2010) 483-502.[Comp]
    8. M. Benaim, J. Weibull, "Deterministic Approximation of Stochastic Evolution in Games", Econometrica 71 (2003) 873-903 (ver Z. Gorodeisky, "Deterministic Approximation of Best-Response Dynamics for the Matching Pennies Game", Games and Economic Behavior 66 (2009) 191-201).
    9. D. Blackwell, "Infinite Games And Analytic Sets", PNAS 58 (1967) 1837.[Real]
      10. .
    10. Ph. Blanchard, A. Krueger, "The Epidemics of Corruption" 2005.
    11. H. Bodlaender, "Kayles on special classes of graphs - An application of the Sprague-Grundy theory", Graph-Theoretic Concepts in Comp. Sci. Lect. Notes in Comp. Sci. 657 (1993) 90-102.[Comp]
    12. G. Bornstein, T. Kugler, S. Zamir, "One Team Must Win, the Other Need Only Not Lose", J. Behav. Dec. Making, 18 (2005) 111-123.
    13. J. Bulow, P. Klemperer, "The Generalized War of Attrition" 89 (1999) 175-189.
    14. O. Candogan, I. Menache, A. Ozdaglar and P. Parrilo, "Flows and Decompositions of Games: Harmonic and Potential Games", Preprint MIT (2010).
    15. J. Canovas, D. Lopez Medina, "Topological Entropy of Cournot-Puu Duopoly"[Real/Funcional]
    16. S. Chakravarty, T. Kaplan, "Vote or Shout", 2010
    17. G. Chichilnisky, "The topological equivalence of the Pareto Condition and the Existence of a Dictator", J. of Math. Economics 9 (1982) 223-233.
    18. G. Chichilnisky, "The foundations of statistics with black swans", to appear in Math. Soc. Sci. [Funcional]
    19. G. Chichilnisky, "On fixed point theorems and social choice paradoxes", Econom. Lett 3 (1979) (ver "Social Choice and the Topology of the space of Preferences", Adv. in Math.)[Topol]
    20. R. Datta, "Universality of Nash equilibria", Math of Operation Research 28 (2003) 424-432.
    21. M. Develin and S. Payne, "Discrete bidding games", E. J. of Combinatorics, 17 (2010) 1-31 (ver Bath, Payne, "Bidding Chess", Math. Intell. 31 (2009) 37-39).
    22. N. Dimitri, "Last minute bidding equilibrium in second price internet auctions", 2007.
    23. R. Ferriere, R. Michod, "Wave Patterns in Spatial Games and the Evolution of Cooperation" (in The Geometry of Ecological Interactions, R Law, J Metz, 318-335. Cambridge University Press 2000). [ode-pde]
    24. L. Fortnow R. Santhanam, "Bounding Rationality by Discounting Time", ICS 2010 (2010)1-12.
    25. A. Fraenkel, "Complexity, Appeal and Challenges of Combinatorial Games", Theoretical Computer Sci. 313 (2004) 393-415 [Comp]
    26. A. Fraenkel, "Games played by Boole and Galois", Discrete Appl. Math., 156 (2008) 420-427.
    27. A. Fraenkel, "Two-player games on cellular automata", en More Games of No Chance, Berkeley (2002) 279-306.
    28. A. Fraenkel, O. Rahat, "Complexity of error-correcting codes derived from combinatorial games", Computers and Games, Lect. Notes in Comp. Sci. 2883 (2003) 201-212.[Comp]
    29. A. Frieze, M. Krivelevich, Po-Shen Loh, "Variations on Cops and Robbers" 2010.[Grafos]
    30. Fudenberg, D. and D. K. Levine "Superstition and Rational Learning," American Economic Review 96 (2006) 630-651.
    31. S Goyal, F Vega-Redondo, "Network formation and social coordination", Games and Econ. Behavior 50 (2005) 178-207.[Comp]
    32. M. Grabisch, A. Rusinowska, "Measuring influence in command games", 2009.
    33. J. Gonzalez-Diaz, P. Borm, H. Norde ,"A Silent Battle Over a Cake", 2004.
    34. O. Haggstrom, G. Kalai, E. Mossel, "A law of large numbers for weighted majority", Advances in Applied Mathematics 37 (2006) 112-123.
    35. J. Hofbauer, "The spatially dominant equilibrium of a game", Ann. of Operations Research 89 (1999) 233-251.
    36. B. Hoyer, K. De Jaegher, "Strategic Network Disruption and Defense", 2010.[Grafos]
    37. M. Isaksson, G. Kindler, E. Mossel, "The Geometry of Manipulation-a Quantitative Proof of the Gibbard Satterthwaite Theorem", arXiv:0911.0517 (2009).
    38. G. Kalai, "A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem", Adv. in Applied Math 29 (2002) 412-426.[Analisis]
    39. G. Kalai, "Noise Sensitivity and Chaos in Social Choice Theory", The Hebrew University of Jerusalem, Preprint 2005.
    40. G. Kalai, "Social Indeterminacy", Econometrica 72 (2004) 1565-1581.
    41. G. Kalai, S. Safra, "Threshold Phenomena and Influence", The Hebrew University of Jerusalem, Preprint 2005.
    42. K. Konrad. D. Kovenock, "The Lifeboat Problem", 2009.
    43. A. Ledvina, R. Sircar, "Dynamic Bertrand Oligopoly", Preprint 2010.[pde]
    44. E. Mossel, "A Quantitative Arrow Theorem", arXiv:0903.2574.[Analisis]
    45. R. Myerson, "Large Poisson Games", Journal of Economic Theory 94 (2000) 7-45 (ver R. Myerson, "Population Uncertainty and Poisson Games", Int. J. of Game Theory 27 (1998) 375).
    46. A. Neyman, J. Spencer, "Complexity and effective prediction", Games and Econ. Beh. 69 (2010) 165-168 (ver A. Neyman, D. Okada, "Two-person repeated games with finite automata" Int. J. Game Theory 29 (2000) 309-325).[Comp]
    47. M. Nowak and K. Sigmund, "Game-Dyamical Aspects of the Prisoner's Dilemma", Appl. Math. Comp. 30 (1989) 191-213.
    48. R. O'Donnell, "Some Topics in Analysis of Boolean Functions", 40th ACM STOC 2009 (incluye Arrow via Fourier).[Comp/Analisis]
    49. J. Oechssler. F. Riedel, "Evolutionary Dynamics on Infinite Strategy spaces", Economic Theory 17 (2001) 141-162.
    50. B. Peleg, H. Peters, "Consistent Voting Systems with a Continuum of Voters", The Hebrew University of Jerusalem, preprint 2003.
    51. C. Rosendal, "Infinite asymptotic games", Annales de l'Institut Fourier 59 (2009) 1359-1384.[Funcional]
    52. M. Rabin, "Effective computability of winning strategies", Contributions to the Theory of Games III 1957.[Comp]
    53. T. Quinn and M. Shubik, "On Local and Network Games", Yale School of Management Working Papers (2004).
    54. N. Stein, P. Parrilo, and A. Ozdaglar, "A new proof of Nash's Theorem via exchangeable equilibria", Preprint MIT 2010.[Comp]
    55. B. von Scarpatetti, C. Wasser, "Signaling in Auctions Among Competitors", 2009.
    56. F. Toxvaerd, "A Theory of Optimal Deadlines", Journal of Economic Dynamics and Control 31 (2007) 493-513.
    57. S. Vassilakis, "Funtorial fixed points", Tech Rep. 33, Stanford (1993) (ver "rules for changing the rules"). [Categorico]
    58. D. Volovik, M. Mobilia, S. Redner, "Dynamics of Strategic Three-Choice Voting", Europhysics Letters (2009) 1-7.[ode]
    59. J. Wakano, M. Nowak, and C. Hauert, "Spatial dynamics of ecological public goods", Proc. Nat. Acad. Sci. 106 (2009) 7910-7914.
    60. S. Weinberger, "On the topological social choice model", J of Economic Theory 115 (2004) 377-384 (ver "Social Choice and Topology, A Case of Pure and Applied Mathematics", de B. Eckmann, 2003).[Topol]

web development by bryant smith | valid xhtml | valid css