Aumann Awarded Nobel Prize

Total Page:16

File Type:pdf, Size:1020Kb

Aumann Awarded Nobel Prize Aumann Awarded Nobel Prize Abraham Neyman Robert J. Aumann, professor of math- application in the analysis of various specific issues. ematics at the Hebrew University and Some of his contributions require very deep and member of the Interdisciplinary Cen- complex technical analysis; others are (as he says ter for Rationality there, shares (with at times) “embarrassingly trivial” mathematically, Thomas C. Schelling) the 2005 Nobel but very profound conceptually [12, p. 1]. He has Prize in Economics [13]. influenced and shaped the field through his pio- Aumann was born in Frankfurt, Ger- neering work. There is hardly an area of game the- many, in 1930, and moved to New ory today where his footsteps are not readily ap- York with his family in 1938. In 1955 parent. Most of Aumann’s research is intimately he completed his Ph.D. in mathemat- connected to central issues in economic theory: on ics at MIT under the supervision of the one hand, these issues provided the motivation Robert J. Aumann George Whitehead. His thesis, in knot and impetus for his work; on the other, his results theory, was published in the Annals of produced novel insights and understandings in Mathematics [1]. economics. In addition to his own pioneering work, In 1955 Aumann joined the Princeton University Aumann’s indirect impact is no less important— group that worked on industrial and military ap- through his many students, collaborators, and col- plications, where he realized the importance and leagues. He inspired them, excited them with his relevance of game theory, then in its infancy. In vision, and led them to further important results 1956 Aumann joined the Institute of Mathematics [12, p. 2]. at the Hebrew University. The limited space allotted to this article does not Over the past half-century, Aumann has played begin to allow a comprehensive account of Au- an essential and indispensable role in shaping mann’s extensive contributions. Thus, the article game theory, and much of economic theory, to be- must confine itself to brief commentary touching come the great success it is today. He promotes a on only a small part of his work. It is important to unified view of the very wide domain of rational note that the scope of each description is not in- behavior, a domain that encompasses areas of dicative of the importance of the contribution. Fur- many apparently disparate disciplines, like eco- ther and more detailed accounts of Aumann’s con- nomics, political science, biology, psychology, math- tributions may be found in [12]. ematics, philosophy, computer science, law, and sta- We start with Aumann’s study of long-term in- tistics. Aumann’s research is characterized by an teractions, which had a most profound impact on unusual combination of breadth and depth. His sci- the social sciences. The mathematical model en- entific contributions are path-breaking, innovative, abling a formal analysis is a supergame G∗, con- comprehensive, and rigorous—from the discovery sisting of an infinite repetition of a given one-stage and formalization of the basic concepts and prin- game1 G. A pure strategy in G∗ assigns a pure ciples, through the development of the appropri- strategy in G to each period/stage, as a function ate tools and methods for their study, to their 1A game G in strategic form consists of a set of players Abraham Neyman is professor of mathematics at the He- N, pure strategy sets Ai for each player i, and payoff brew University of Jerusalem. His email address is functions gi, which describe the payoff to player i as a func- [email protected]. tion of the strategy profiles a ∈ A := ×i∈N Ai . 44 NOTICES OF THE AMS VOLUME 53, NUMBER 1 of the history of play up to that stage. A profile of information to your disadvantage; re- supergame strategies, one for each player, defines vealing, to use the information your- the play, or sequence of stage actions. The payoff self, and to permit the other players to associated with a play of the supergame is essen- use it to your advantage [8, pp. 46–47]. tially an average of the stage payoffs. In 1959 Aumann [2] defined the notion of a The stress here is on the strategic use strong equilibrium—a strategy profile where no of information—when and how to reveal group of players can gain by unilaterally changing and when and how to conceal, when to their strategies—and characterized the strong equi- believe revealed information and when librium outcomes of the supergame by showing that not, etc. [7, p. 23]. it coincides with the so-called β-core of G. When Aumann’s 1959 methodology is applied to Nash This problem of the optimal use of information is equilibrium—a strategy profile where no single solved in an explicit and elegant way in [9]. player can gain by unilaterally changing his strat- Another substantial line of contributions of Au- egy—the result is essentially the so-called Folk The- mann is the introduction and study of the contin- orem for supergames: the set of Nash equilibria of uum idea in game theory and economic theory. the supergame G∗ coincides with the set of feasi- This includes modeling perfectly competitive ble and individual rational payoffs in the one-stage economies as economies with a continuum of game. In 1976 Aumann and Shapley [11] (and Ru- traders and proving the equivalence of the core and binstein2 in independent work) proved that the competitive equilibrium [3] as well as the equiva- equilibrium payoffs and the perfect equilibrium lence of the core (and competitive equilibrium) payoffs of the supergame G∗ coincide. and the value [5], proving the existence of the com- Supergames are repeated games of complete in- petitive equilibrium [4], and introducing and ex- formation; it is assumed that all players know pre- tensively developing the (Aumann-Shapley) value cisely the one-shot game that is being repeatedly of coalitional games with a continuum of players played. [10]. These models with a continuum of agents en- able precise analysis of economic and political sys- The theory of repeated games of com- tems where groups of participants have signifi- plete information is concerned with the cant influence over the outcome, but each evolution of fundamental patterns of in- individual’s influence is negligible. teraction between people (or for that Another fundamental contribution of Aumann matter, animals; the problems it attacks is “Agreeing to Disagree” [6]: it formalizes the no- are similar to those of social biology). tion of common knowledge and shows (the some- Its aim is to account for phenomena what unintuitive result) that if two agents start such as cooperation, altruism, revenge, with the same prior beliefs, and if their posterior threats (self-destructive or otherwise), beliefs (about a specific event), which are based on etc.—phenomena which may at first different private information, are common knowl- seem irrational—in terms of the usual edge, then these posterior beliefs coincide. This ‘selfish’ utility-maximizing paradigm of paper had a major impact; it led to the development game theory and neoclassical econom- of the area known as interactive epistemology and ics [7, p. 11]. has found many applications in different disci- The model of repeated games with incomplete plines like economics and computer science. information, introduced in 1966 by Aumann and Other fundamental contributions include the Maschler [9], analyzes long-term interactions in introduction and study of correlated equilibrium, which some or all of the players do not know which the study of bounded rationality, and many im- stage game G is being played. The game G = Gk de- portant contributions to cooperative game theory: pends on a parameter k; at the start of the game extending the theory of transferable utility (TU) a commonly known lottery q(k) with outcomes in games to general nontransferable utility (NTU) a product set S = × S is performed and player i is games, formulating a simple set of axioms that i i 3 informed of the i-th coordinate of the outcome. The characterize the NTU-value, and the “Game- repetition enables players to infer and learn in- theoretic analysis of a bankruptcy problem from 4 formation about the other players from their be- the Talmud”. havior, and therefore there is Robert J. Aumann has been a member of the U.S. National Academy of Sciences since 1985, a a subtle interplay of concealing and re- vealing information: concealing, to pre- 3Introduced in L. S. Shapley, Utility comparison and the vent the other players from using the theory of games, La Décision (Paris: Edition du C.N.R.S., 1969), pp. 251–263. 2A. Rubinstein, Equilibrium in Supergames, RM-26, Hebrew 4With M. Maschler, Journal of Economic Theory 36 (1985), University of Jerusalem, 1976. pp. 195–213. JANUARY 2006 NOTICES OF THE AMS 45 member of the Israel Academy of Sciences and Hu- [5] ——— , Values of markets with a continuum of traders, manities since 1989, a Foreign Honorary Econometrica 43 (1975), 611–646. Member of the American Academy of Arts and Sci- [6] ——— , Agreeing to disagree, Annals of Statistics 4 ences since 1974, and a corresponding fellow of the (1976), 1236–1239. British Academy since 1995. He received the Har- [7] ——— , Survey of repeated games, Essays in Game The- vey Prize in Science and Technology in 1983, the ory and Mathematical Economics in Honor of Oskar Morgenstern, Vol. 4 of Gesellschaft, Recht, Wirtschaft, Israel Prize in Economics in 1994, the Lanchester Wissenschaftsverlag, Bibliographisches Institut, Prize in Operations Research in 1995, the Nemmers Mannheim, 1981, pp. 11–42. Prize in Economics in 1998, the EMET prize in Eco- [8] ——— , What is game theory trying to accomplish?, nomics in 2002, the von Neumann prize in Oper- Frontiers of Economics (K.
Recommended publications
  • Matchings and Games on Networks
    Matchings and games on networks by Linda Farczadi A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics and Optimization Waterloo, Ontario, Canada, 2015 c Linda Farczadi 2015 Author's Declaration I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract We investigate computational aspects of popular solution concepts for different models of network games. In chapter 3 we study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We fully characterize the existence of balanced solutions and provide the first polynomial time algorithm for their computation. Our methods use a new idea of reducing an instance with general capacities to an instance with unit capacities defined on an auxiliary graph. This chapter is an extended version of the conference paper [32]. In chapter 4 we propose a generalization of the classical stable marriage problem. In our model the preferences on one side of the partition are given in terms of arbitrary bi- nary relations, that need not be transitive nor acyclic. This generalization is practically well-motivated, and as we show, encompasses the well studied hard variant of stable mar- riage where preferences are allowed to have ties and to be incomplete. Our main result shows that deciding the existence of a stable matching in our model is NP-complete.
    [Show full text]
  • John Von Neumann Between Physics and Economics: a Methodological Note
    Review of Economic Analysis 5 (2013) 177–189 1973-3909/2013177 John von Neumann between Physics and Economics: A methodological note LUCA LAMBERTINI∗y University of Bologna A methodological discussion is proposed, aiming at illustrating an analogy between game theory in particular (and mathematical economics in general) and quantum mechanics. This analogy relies on the equivalence of the two fundamental operators employed in the two fields, namely, the expected value in economics and the density matrix in quantum physics. I conjecture that this coincidence can be traced back to the contributions of von Neumann in both disciplines. Keywords: expected value, density matrix, uncertainty, quantum games JEL Classifications: B25, B41, C70 1 Introduction Over the last twenty years, a growing amount of attention has been devoted to the history of game theory. Among other reasons, this interest can largely be justified on the basis of the Nobel prize to John Nash, John Harsanyi and Reinhard Selten in 1994, to Robert Aumann and Thomas Schelling in 2005 and to Leonid Hurwicz, Eric Maskin and Roger Myerson in 2007 (for mechanism design).1 However, the literature dealing with the history of game theory mainly adopts an inner per- spective, i.e., an angle that allows us to reconstruct the developments of this sub-discipline under the general headings of economics. My aim is different, to the extent that I intend to pro- pose an interpretation of the formal relationships between game theory (and economics) and the hard sciences. Strictly speaking, this view is not new, as the idea that von Neumann’s interest in mathematics, logic and quantum mechanics is critical to our understanding of the genesis of ∗I would like to thank Jurek Konieczny (Editor), an anonymous referee, Corrado Benassi, Ennio Cavaz- zuti, George Leitmann, Massimo Marinacci, Stephen Martin, Manuela Mosca and Arsen Palestini for insightful comments and discussion.
    [Show full text]
  • Koopmans in the Soviet Union
    Koopmans in the Soviet Union A travel report of the summer of 1965 Till Düppe1 December 2013 Abstract: Travelling is one of the oldest forms of knowledge production combining both discovery and contemplation. Tjalling C. Koopmans, research director of the Cowles Foundation of Research in Economics, the leading U.S. center for mathematical economics, was the first U.S. economist after World War II who, in the summer of 1965, travelled to the Soviet Union for an official visit of the Central Economics and Mathematics Institute of the Soviet Academy of Sciences. Koopmans left with the hope to learn from the experiences of Soviet economists in applying linear programming to economic planning. Would his own theories, as discovered independently by Leonid V. Kantorovich, help increasing allocative efficiency in a socialist economy? Koopmans even might have envisioned a research community across the iron curtain. Yet he came home with the discovery that learning about Soviet mathematical economists might be more interesting than learning from them. On top of that, he found the Soviet scene trapped in the same deplorable situation he knew all too well from home: that mathematicians are the better economists. Key-Words: mathematical economics, linear programming, Soviet economic planning, Cold War, Central Economics and Mathematics Institute, Tjalling C. Koopmans, Leonid V. Kantorovich. Word-Count: 11.000 1 Assistant Professor, Department of economics, Université du Québec à Montréal, Pavillon des Sciences de la gestion, 315, Rue Sainte-Catherine Est, Montréal (Québec), H2X 3X2, Canada, e-mail: [email protected]. A former version has been presented at the conference “Social and human sciences on both sides of the ‘iron curtain’”, October 17-19, 2013, in Moscow.
    [Show full text]
  • A Beautiful Math : John Nash, Game Theory, and the Modern Quest for a Code of Nature / Tom Siegfried
    A BEAUTIFULA BEAUTIFUL MATH MATH JOHN NASH, GAME THEORY, AND THE MODERN QUEST FOR A CODE OF NATURE TOM SIEGFRIED JOSEPH HENRY PRESS Washington, D.C. Joseph Henry Press • 500 Fifth Street, NW • Washington, DC 20001 The Joseph Henry Press, an imprint of the National Academies Press, was created with the goal of making books on science, technology, and health more widely available to professionals and the public. Joseph Henry was one of the founders of the National Academy of Sciences and a leader in early Ameri- can science. Any opinions, findings, conclusions, or recommendations expressed in this volume are those of the author and do not necessarily reflect the views of the National Academy of Sciences or its affiliated institutions. Library of Congress Cataloging-in-Publication Data Siegfried, Tom, 1950- A beautiful math : John Nash, game theory, and the modern quest for a code of nature / Tom Siegfried. — 1st ed. p. cm. Includes bibliographical references and index. ISBN 0-309-10192-1 (hardback) — ISBN 0-309-65928-0 (pdfs) 1. Game theory. I. Title. QA269.S574 2006 519.3—dc22 2006012394 Copyright 2006 by Tom Siegfried. All rights reserved. Printed in the United States of America. Preface Shortly after 9/11, a Russian scientist named Dmitri Gusev pro- posed an explanation for the origin of the name Al Qaeda. He suggested that the terrorist organization took its name from Isaac Asimov’s famous 1950s science fiction novels known as the Foun- dation Trilogy. After all, he reasoned, the Arabic word “qaeda” means something like “base” or “foundation.” And the first novel in Asimov’s trilogy, Foundation, apparently was titled “al-Qaida” in an Arabic translation.
    [Show full text]
  • Nine Takes on Indeterminacy, with Special Emphasis on the Criminal Law
    University of Pennsylvania Carey Law School Penn Law: Legal Scholarship Repository Faculty Scholarship at Penn Law 2015 Nine Takes on Indeterminacy, with Special Emphasis on the Criminal Law Leo Katz University of Pennsylvania Carey Law School Follow this and additional works at: https://scholarship.law.upenn.edu/faculty_scholarship Part of the Criminal Law Commons, Law and Philosophy Commons, and the Public Law and Legal Theory Commons Repository Citation Katz, Leo, "Nine Takes on Indeterminacy, with Special Emphasis on the Criminal Law" (2015). Faculty Scholarship at Penn Law. 1580. https://scholarship.law.upenn.edu/faculty_scholarship/1580 This Article is brought to you for free and open access by Penn Law: Legal Scholarship Repository. It has been accepted for inclusion in Faculty Scholarship at Penn Law by an authorized administrator of Penn Law: Legal Scholarship Repository. For more information, please contact [email protected]. ARTICLE NINE TAKES ON INDETERMINACY, WITH SPECIAL EMPHASIS ON THE CRIMINAL LAW LEO KATZ† INTRODUCTION ............................................................................ 1945 I. TAKE 1: THE COGNITIVE THERAPY PERSPECTIVE ................ 1951 II. TAKE 2: THE MORAL INSTINCT PERSPECTIVE ..................... 1954 III. TAKE 3: THE CORE–PENUMBRA PERSPECTIVE .................... 1959 IV. TAKE 4: THE SOCIAL CHOICE PERSPECTIVE ....................... 1963 V. TAKE 5: THE ANALOGY PERSPECTIVE ................................. 1965 VI. TAKE 6: THE INCOMMENSURABILITY PERSPECTIVE ............ 1968 VII. TAKE 7: THE IRRATIONALITY-OF-DISAGREEMENT PERSPECTIVE ..................................................................... 1969 VIII. TAKE 8: THE SMALL WORLD/LARGE WORLD PERSPECTIVE 1970 IX. TAKE 9: THE RESIDUALIST PERSPECTIVE ........................... 1972 CONCLUSION ................................................................................ 1973 INTRODUCTION The claim that legal disputes have no determinate answer is an old one. The worry is one that assails every first-year law student at some point.
    [Show full text]
  • 2Majors and Minors.Qxd.KA
    APPLIED MATHEMATICS AND STATISTICS Spring 2007: updates since Fall 2006 are in red Applied Mathematics and Statistics (AMS) Major and Minor in Applied Mathematics and Statistics Department of Applied Mathematics and Statistics, College of Engineering and Applied Sciences CHAIRPERSON: James Glimm UNDERGRADUATE PROGRAM DIRECTOR: Alan C. Tucker UNDERGRADUATE SECRETARY: Elizabeth Ahmad OFFICE: P-139B Math Tower PHONE: (631) 632-8370 E-MAIL: [email protected] WEB ADDRESS: http://naples.cc.sunysb.edu/CEAS/amsweb.nsf Students majoring in Applied Mathematics and Statistics often double major in one of the following: Computer Science (CSE), Economics (ECO), Information Systems (ISE) Faculty Bradley Plohr, Adjunct Professor, Ph.D., he undergraduate program in Princeton University: Conservation laws; com- Hongshik Ahn, Associate Professor, Ph.D., Applied Mathematics and Statistics putational fluid dynamics. University of Wisconsin: Biostatistics; survival Taims to give mathematically ori- analysis. John Reinitz, Professor, Ph.D., Yale University: ented students a liberal education in quan- Mathematical biology. Esther Arkin, Professor, Ph.D., Stanford titative problem solving. The courses in University: Computational geometry; combina- Robert Rizzo, Assistant Professor, Ph.D., Yale this program survey a wide variety of torial optimization. University: Bioinformatics; drug design. mathematical theories and techniques Edward J. Beltrami, Professor Emeritus, Ph.D., David Sharp, Adjunct Professor, Ph.D., that are currently used by analysts and Adelphi University: Optimization; stochastic California Institute of Technology: Mathematical researchers in government, industry, and models. physics. science. Many of the applied mathematics Yung Ming Chen, Professor Emeritus, Ph.D., Ram P. Srivastav, Professor, D.Sc., University of courses give students the opportunity to New York University: Partial differential equa- Glasgow; Ph.D., University of Lucknow: Integral develop problem-solving techniques using equations; numerical solutions.
    [Show full text]
  • Handbook of Game Theory, Vol. 3 Edited by Robert Aumann and Sergiu Hart, Elsevier, New York, 2002
    Games and Economic Behavior 46 (2004) 215–218 www.elsevier.com/locate/geb Handbook of Game Theory, Vol. 3 Edited by Robert Aumann and Sergiu Hart, Elsevier, New York, 2002. This is the final volume of three that organize and summarize the game theory literature, a task that becomes more necessary as the field grows. In the 1960s the main actors could have met in a large room, but today there are several national conferences with concurrent sessions, and the triennial World Congress. MathSciNet lists almost 700 pieces per year with game theory as their primary or secondary classification. The problem is not quite that the yearly output is growing—this number is only a bit higher than two decades ago— but simply that it is accumulating. No one can keep up with the whole literature, so we have come to recognize these volumes as immensely valuable. They are on almost everyone’s shelf. The initial four chapters discuss the basics of the Nash equilibrium. Van Damme focuses on the mathematical properties of refinements, and Hillas and Kohlberg work up to the Nash equilibrium from below, discussing its rationale with respect to dominance concepts, rationalizability, and correlated equilibria. Aumann and Heifetz treat the foundations of incomplete information, and Raghavan looks at the properties of two-person games that do not generalize. There is less overlap among the four chapters than one would expect, and it is valuable to get these parties’ views on the basic questions. It strikes me as lively and healthy that after many years the field continues to question and sometimes modify its foundations.
    [Show full text]
  • Games of Threats
    Accepted Manuscript Games of threats Elon Kohlberg, Abraham Neyman PII: S0899-8256(17)30190-2 DOI: https://doi.org/10.1016/j.geb.2017.10.018 Reference: YGAME 2771 To appear in: Games and Economic Behavior Received date: 30 August 2017 Please cite this article in press as: Kohlberg, E., Neyman, A. Games of threats. Games Econ. Behav. (2017), https://doi.org/10.1016/j.geb.2017.10.018 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. GAMES OF THREATS ELON KOHLBERG∗ AND ABRAHAM NEYMAN+ Abstract. Agameofthreatsonafinitesetofplayers,N, is a function d that assigns a real number to any coalition, S ⊆ N, such that d(S)=−d(N \S). A game of threats is not necessarily a coalitional game as it may fail to satisfy the condition d(∅)=0.We show that analogs of the classic Shapley axioms for coalitional games determine a unique value for games of threats. This value assigns to each player an average of d(S)acrossall the coalitions that include the player. Games of threats arise naturally in value theory for strategic games, and may have applications in other branches of game theory. 1. Introduction The Shapley value is the most widely studied solution concept of cooperative game theory.
    [Show full text]
  • DEPARTMENT of ECONOMICS NEWSLETTER Issue #1
    DEPARTMENT OF ECONOMICS NEWSLETTER Issue #1 DEPARTMENT OF ECONOMICS SEPTEMBER 2017 STONY BROOK UNIVERSITY IN THIS ISSUE Message from the Chair by Juan Carlos Conesa Greetings from the Department of Regarding news for the coming Economics in the College of Arts and academic year, we are very excited to Sciences at Stony Brook University! announce that David Wiczer, currently Since the beginning of the spring working for the Research Department of semester, we’ve celebrated several the Federal Reserve Bank of St Louis, 2017 Commencement Ceremony accomplishments of both students and will be joining us next semester as an Juan Carlos Conesa, Vincent J. Cassidy (BA ‘81), Anand George (BA ‘02) and Hugo faculty alike. I’d also like to tell you of Assistant Professor. David is an what’s to come for next year. enthusiastic researcher working on the Benitez‐Silva intersection of Macroeconomics and The beginning of 2017 has been a very Labor Economics, with a broad exciting time for our students. Six of our perspective combining theoretical, PhD students started looking for options computational and data analysis. We are to start exciting professional careers. really looking forward to David’s Arda Aktas specializes in Demographics, interaction with both students and and will be moving to a Post‐doctoral faculty alike. We are also happy to position at the World Population welcome Prof. Basak Horowitz, who will Program in the International Institute for join the Economics Department in Fall Applied Systems Analysis (IIASA), in 2017, as a new Lecturer. Basak’s Austria. Anju Bhandari specializes in research interests are microeconomic Macroeconomics, and has accepted a theory, economics of networks and New faculty, David Wiczer position as an Assistant Vice President matching theory, industrial organization with Citibank, NY.
    [Show full text]
  • Games of Threats
    Games of Threats The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Kohlberg, Elon, and Abraham Neyman. "Games of Threats." Games and Economic Behavior 108 (March 2018): 139–145. Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:39148383 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#OAP GAMES OF THREATS ELON KOHLBERG∗ AND ABRAHAM NEYMAN+ Abstract. Agameofthreatsonafinitesetofplayers,N, is a function d that assigns a real number to any coalition, S ⊆ N, such that d(S)=−d(N \S). A game of threats is not necessarily a coalitional game as it may fail to satisfy the condition d(∅)=0.We show that analogs of the classic Shapley axioms for coalitional games determine a unique value for games of threats. This value assigns to each player an average of d(S)acrossall the coalitions that include the player. Games of threats arise naturally in value theory for strategic games, and may have applications in other branches of game theory. 1. Introduction The Shapley value is the most widely studied solution concept of cooperative game theory. It is defined on coalitional games, which are the standard objects of the theory. A coalitional game on a finite set of players, N, is a function v that assigns a real number to any subset (“coalition”), S ⊆ N, such that v(∅) = 0.
    [Show full text]
  • Chronology of Game Theory
    Chronology of Game Theory http://www.econ.canterbury.ac.nz/personal_pages/paul_walker/g... Home | UC Home | Econ. Department | Chronology of Game Theory | Nobel Prize A Chronology of Game Theory by Paul Walker September 2012 | Ancient | 1700 | 1800 | 1900 | 1950 | 1960 | 1970 | 1980 | 1990 | Nobel Prize | 2nd Nobel Prize | 3rd Nobel Prize | 0-500AD The Babylonian Talmud is the compilation of ancient law and tradition set down during the first five centuries A.D. which serves as the basis of Jewish religious, criminal and civil law. One problem discussed in the Talmud is the so called marriage contract problem: a man has three wives whose marriage contracts specify that in the case of this death they receive 100, 200 and 300 respectively. The Talmud gives apparently contradictory recommendations. Where the man dies leaving an estate of only 100, the Talmud recommends equal division. However, if the estate is worth 300 it recommends proportional division (50,100,150), while for an estate of 200, its recommendation of (50,75,75) is a complete mystery. This particular Mishna has baffled Talmudic scholars for two millennia. In 1985, it was recognised that the Talmud anticipates the modern theory of cooperative games. Each solution corresponds to the nucleolus of an appropriately defined game. 1713 In a letter dated 13 November 1713 Francis Waldegrave provided the first, known, minimax mixed strategy solution to a two-person game. Waldegrave wrote the letter, about a two-person version of the card game le Her, to Pierre-Remond de Montmort who in turn wrote to Nicolas Bernoulli, including in his letter a discussion of the Waldegrave solution.
    [Show full text]
  • 2018 Unité De Recherche Dossier D'autoévaluation
    Évaluation des unités de recherche Novembre 2016 Vague D Campagne d’évaluation 2017 – 2018 Unité de recherche Dossier d’autoévaluation Informations générales Nom de l’unité : Centre de Recherche en Mathématiques de la Décision Acronyme : CEREMADE UMR CNRS 7534 Champ de recherche de rattachement : Recherche Nom du directeur pour le contrat en cours : Vincent Rivoirard Nom du directeur pour le contrat à venir : Vincent Rivoirard Type de demande : Renouvellement à l’identique x Restructuration □ Création ex nihilo □ Établissements et organismes de rattachement : Liste des établissements et organismes tutelles de l’unité de recherche pour le contrat en cours et pour le prochain contrat (tutelles). Contrat en cours : | Prochain contrat : - Université Paris-Dauphine |- Université Paris-Dauphine - CNRS |- CNRS Choix de l’évaluation interdisciplinaire de l’unité de recherche ou de l’équipe interne : Oui □ Non x Vague D : campagne d’évaluation 2017 – 2018 1 Département d’évaluation de la recherche 2 Table des matières 1 Présentation du Ceremade7 1.1 Introduction..............................................7 1.2 Tableau des effectifs et moyens du Ceremade............................7 1.2.1 Effectifs............................................7 1.2.2 Parité.............................................9 1.2.3 Moyens financiers......................................9 1.2.4 Locaux occupés........................................ 10 1.2.5 Ressources documentaires.................................. 10 1.3 Politique scientifique......................................... 10 1.3.1 Missions et objectifs scientifiques.............................. 10 1.3.2 Structuration......................................... 11 1.3.3 Recrutements......................................... 12 1.3.4 Illustration de la mise en œuvre de la stratégie scientifique adoptée en 2012 en direction des applications........................................ 14 1.3.5 Programmes de soutien à la recherche du Ceremade déployés par la Fondation Dauphine, PSL, la FSMP et la Région Ile-de-France.........................
    [Show full text]