Séminaires

Séminaire Parisien de Théorie des Jeux

• Prochainement
• Archives

Prochainement

Aucun événement à venir.

Archives

• Lundi 28 juin 2021 11:00-12:00

  Online

  BOURSIER Etienne (ENS Paris-Saclay) : Decentralized Learning in Online Queuing Systems

  Résumé

  Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each of them treating only at most one packet at a time. In the centralized case, the number of accumulated packets remains bounded (i.e., the system is stable) as long as the ratio between service rates and arrival rates is larger than 1. In the decentralized case, individual no-regret strategies ensures stability when this ratio is larger than 2. Yet, myopically minimizing regret disregards the long term effects due to the carryover of packets to further rounds. On the other hand, minimizing long term costs leads to stable Nash equilibria as soon as the ratio exceeds e/(e-1). Stability with decentralized learning strategies with a ratio below 2 was a major remaining question. We first argue that for ratios up to 2, cooperation is required for stability of learning strategies, as selfish minimization of policy regret, a patient notion of regret, might indeed still be unstable in this case. We therefore consider cooperative queues and propose the first learning decentralized algorithm guaranteeing stability of the system as long as the ratio of rates is larger than 1, thus reaching performances comparable to centralized strategies.

• Lundi 21 juin 2021 11:00-12:00

  Online

  RENAULT Jérôme (TSE) : Strategic Information transmission with sender’s approval

  Co-author: Françoise Forges

  Résumé

  We consider sender–receiver games in which the sender has finitely many types and the receiver makes a decision in a compact set. The new feature is that, after the cheap talk phase, the receiver makes a proposal to the sender, which the latter can reject in favor of an outside option. We focus on situations in which the sender’s approval is absolutely crucial to the receiver, namely, on equilibria in which the sender does not exit at the approval stage. We show that if the sender has only two types or if the receiver’s preferences over decisions do not depend on the type of the sender, there exists a (perfect Bayesian Nash) partitional equilibrium without exit, in which the sender transmits information by means of a pure strategy. The previous existence results do not extend: we construct a counter-example (with three types for the sender and type-dependent utility functions) in which there is no equilibrium without exit, even if the sender can randomize over messages. Communication equilibria without exit always exist in the three type case, and the question is open for 4 or more types.

• Lundi 14 juin 2021 11:00-12:00

  Online

  PIZARRO Dana (TSE) : On a competitive selection problem with recall

  Résumé

  We consider a problem where items arrive sequentially over time and two agents compete to choose the best possible item. We describe the game induced by the problem in two settings: one in which only take-it-or-leave-it strategies are allowed and another where it is possible to select an item that appeared in the past, if it is still available. We study the set of subgame perfect Nash equilibrium payoffs and we find tight bounds for the Price of Anarchy and Price of Stability of the latter setting when the number of arrivals is two.

• Lundi 31 mai 2021 11:00-12:00

  Online

  PATTY Morgan (LEDa, PSL) : Top Dominance

  Résumé

  To deal with issues of inconsistency faced by iterated elimination of weakly or strictly dominated strategies (IEWDS or IESDS), we propose a new elimination procedure. Our procedure, named iterated elimination of top dominated strategies (IETDS), is based on the new notion of top dominance. It is more consistent than IESDS in a certain sense. Top dominance is more restrictive than weak dominance (and may be more restrictive than strict dominance): it requires weak dominance and strict payoff domination of the strategy on a specific profiles set. Furthermore, it requires that the dominating strategy to be not weakly dominated. Contrary to IESDS, IETDS may reduce the set of Nash equilibria (whilst never eliminating strict Nash equilibria) without the problems of order dependence, mutability and spurious Nash equilibria encountered by IEWDS and IESDS.

• Lundi 17 mai 2021 11:00-12:00

  Online

  FLESCH Janos (Maastricht University) : A competitive search game with a moving target

  Résumé

  The talk is based on two papers. The first is joint work with Benoit Duvocelle, Mathias Staudigl, Dries Vermeulen, and the second with Benoit Duvocelle, Hui Min Shi, Dries Vermeulen. Abstract: We introduce a discrete-time search game, in which two players compete to find an object first. The object moves according to a time-varying Markov chain on finitely many states. The players know the Markov chain and the initial probability distribution of the object, but do not observe the current state of the object. The players are active in turns. The active player chooses a state, and this choice is observed by the other player. If the object is in the chosen state, the active player wins and the game ends. Otherwise, the object moves according to the Markov chain and the game continues at the next period. We show that this game admits a value, and for any error-term epsilon>0, each player has a pure (subgame-perfect) epsilon-optimal strategy. Interestingly, a 0-optimal strategy does not always exist. We derive results on the properties of the value and the epsilon-optimal strategies. Moreover, we examine the performance of the finite truncation strategies. We devote special attention to the time-homogeneous case, where additional results hold. We also investigate a related model, where the active player is chosen randomly at each period. In this case, the results are quite different, and greedy strategies (which always recommend to choose a state that contains the object with the highest probability) play the main role

• Lundi 10 mai 2021 11:00-12:00

  online

  DEMEZE-JOUATSA Ghislain-Herman (Bielefeld University) : Repetition and cooperation: a model of finitely repeated games with objective ambiguity

  Résumé

  We present a model of repeated games in which players can strategically make use of objective ambiguity. In each round of the repeated game, in addition to the classic pure and mixed actions, players can employ objectively ambiguous actions by using imprecise probabilistic devices such as Ellsberg urns to conceal their intentions. We find that adding an infinitesimal level of ambiguity can be enough to approximate collusive payoffs via subgame perfect equilibrium strategies of the finitely repeated game. Our main theorem states that if each player has many continuation equilibrium payoffs in ambiguous actions, any feasible payoff vector of the original stage-game that dominates the mixed strategy maxmin payoff vector is both ex-ante and ex-post approachable by means of subgame perfect equilibrium strategies of the finitely repeated game with discounting. Our condition is also necessary.

• Lundi 3 mai 2021 11:00-12:00

  online

  FEUILLOLEY Laurent (LIRIS,CNRS, Université Lyon 1) : The Secretary Problem with Independent Sampling

  Co-authors: José Correa, Andrés Cristi, Tim Oosterwijk, and Alexandros Tsigonias-Dimitriadis

  Résumé

  The secretary problem is a classic online decision problem. In this problem, an adversary first chooses some n numbers, then these numbers are shuffled at random and presented to the player one by one. For each number, the player has two options: discard the number and continue, or keep the number and stop the game. The player wins if she keeps the highest number of the whole set. It is clearly not possible to win all the time: when one decides to stop there might be a higher number in the rest of the sequence, and when one discards a number, it might actually be the highest of the sequence. But surprisingly one can win with probability 1/e. This has been known for several decades. An issue with the secretary problem is that it assumes that the player has absolutely no information about the numbers, which reduces its applicability. A recent research direction is to understand what happens when one knows a distribution or samples etc. We study a simple such setting for which we prove tight results.

• Lundi 8 février 2021 11:00-12:00

  online

  KOESSLER Frédéric (PSE) : Information Design by an Informed Designer

  Co-author : Vasiliki Skreta

  Résumé

  A designer is privately informed about the state and chooses an information disclosure mechanism to influence the decisions of multiple agents playing a game. We define an intuitive class of incentive feasible information disclosure mechanisms which we coin interim optimal mechanisms. We prove that an interim optimal mechanism exists, and that it is an equilibrium outcome of the interim information design game. An ex-ante optimal mechanism may not be interim optimal but it is in leading settings in which action sets are binary. Likewise, in settings in which an ex-ante optimal mechanism is full disclosure then it is interim optimal. We relate interim optimal mechanisms with other solutions of informed designer problems.

• Lundi 1er février 2021 11:00-12:00

  online

  LOVO Stefano (HEC) : Socially responsible finance: How to Optimize Impact?

  Co-author : Augustin Landier

  Résumé

  We consider a general equilibrium productive economy with negative externalities. Investors seek to maximize returns, entrepreneurs profits, and a socially responsible fund social welfare. We show that the fund is able to raise assets and improve social welfare iff: (i) it commits to finance only firms that cap their emissions and (ii) capital allocation is subject to frictions. The fund should prioritize investments in companies with acute negative externalities and facing strong capital search friction. It can amplify its impact by imposing restrictions on the suppliers of the firms it finances. Investing in already clean sectors has no impact.

• Lundi 25 janvier 2021 11:00-12:00

  on line

  JAIN Atulya : Dynamic cheap talk with no feedback

  Résumé

  We study a dynamic sender-receiver game, where the sequence of states follows a Markov chain. The sender provides valuable information but gets no feedback on the receiver’s actions. Under certain assumptions, we characterize the set of uniform equilibrium payoffs with the help of a static cheap talk game, where the marginal distribution of messages is fixed. We show that the sender is able to bridge the value of commitment and secure the Bayesian persuasion payoff of the static game.

• Mardi 19 janvier 2021

  Workshop Games, Approachability and Learning

  Texte intégral [pdf]

• Lundi 18 janvier 2021

  Workshop Games, Approachability and Learning

  Texte intégral [pdf]

• Lundi 11 janvier 2021 11:00-12:00

  Zoom : https://hec-fr.zoom.us/j/95796468806 ID de réunion : 957 9646 8806

  GAUBERT Stéphane (INRIA, CMAP, Ecole Polytechnique) : The geometry of fixed points sets of Shapley operators

  Marianne Akian and Sara Vannucci

  Résumé

  Shapley operators of undiscounted zero-sum two-player games are order-preserving maps that commute with the addition of a constant. The fixed points of these Shapley operators play a key role in the study of games with mean payoff: the existence of a fixed point is guaranteed by ergodicity conditions, moreover, fixed points that are distinct (up to an additive constant) determine distinct optimal stationary strategies. We provide a series of characterizations of fixed point sets of Shapley operators in finite dimension (i.e., for games with a finite state space). Some of these characterizations are of a lattice theoretical nature, whereas some other rely on metric geometry and tropical geometry. More precisely, we show that fixed point sets of Shapley operators are special instances of hyperconvex spaces (non-expansive retracts of sup-norm spaces) that are lattices in the induced partial order. They are also characterized by a property of ``best co-approximation'' arising in the theory of nonexpansive retracts of Banach spaces. Moreover, they retain properties of convex sets, with a notion of ``convex hull'' defined only up to isomorphism. We finally examine the special case of deterministic games with finite action spaces. Then, fixed point sets have a structure of polyhedral complexes, which include as special cases tropical polyhedra. These complexes have a cell decomposition attached to stationary strategies of the players, in which each cell is an alcoved polyhedron of An type.

• Lundi 4 janvier 2021 11:00-12:00

  RAGEL Thomas (CEREMADE, Dauphine PSL) : TBA

• Lundi 14 décembre 2020 11:00-12:00

  On line

  MARLATS Chantal (LEMMA, Paris 2) : Voluntary confinement

• Lundi 2 novembre 2020 11:00-12:00

  A simple refinement of sequential equilibria

  Résumé

  We provide a simple refinement of sequential equilibria in generic finite extensive form games. In these equilibria, at information sets that are one (agent) deviation away from the equilibrium path, the beliefs put positive probability only on those nodes which can be reached by one deviation of an agent. Namely, multiple deviations of agents are infinitely less likely than a single deviation of a single agent. In generic games Mertens stable outcomes can be supported with such a belief.

• Lundi 12 octobre 2020 11:00-12:00

  room 314 (third floor) at Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème.

  PEREZ-RICHET Eduardo (Sciences Po, département d’économie) : Test design with unobservable falsification

  Résumé

  We study receiver-optimal test design under manipulations by an agent who can falsify the data input of the test. We characterize an optimal test and an optimal falsification proof tests under different assumptions on the cost function, and discuss the welfare properties of such tests.

• Lundi 5 octobre 2020 11:00-12:00

  room 314 (third floor) at Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème.

  AMOUSSOU-GUENOU Yackolley (CEA List & LIP6, Sorbonne Université) : Is distributed consensus possible in committee-based blockchains?

  Résumé

  We study the rational behaviors of participants in committee-based blockchains. Committee-based blockchains rely on specific blockchain consensus that must be guaranteed in presence of rational participants. We consider a simplified blockchain consensus algorithm based on existing or proposed committee-based blockchains that encapsulates the main actions of the participants: voting for a block, and checking its validity. Knowing that those actions have costs, and achieving the consensus gives rewards to committee members, we study using game theory how strategic players behave while trying to maximizing their gains.

• Lundi 28 septembre 2020 11:00-12:00

  either amphi Hermite (ground floor) or room 314 (third floor) at Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  SALAMANCA Andrés (PSE) : Biased Mediators in Conflict Resolution

  Résumé

  What is the role of biased mediators for reaching negotiated settlements in social conflicts? Previous empirical research in Political Sciences has suggested that mediators are often more effective if they are unbiased (or impartial).This research contributes to the previous debate following a game theoretic analysis. We study a model of cheap-talk in which an agent possesses private information about a binary state of the world. This information is required by an uninformed principal in order to take an action in the real line. Individuals have quadratic preferences, with a difference in their bliss point parameterized by a state-dependent bias parameter. Therefore, a conflict of interests between both parties arises because of a discrepancy in their bliss point. Provided that mediation is beneficial for at least one party, we show that whenever the variation of the bias across states is large enough, the agent will refuse to participate in a mediation process that is biased towards the principal. Otherwise, the mediator’s bias is inconsequential for reaching an agreement, hence a biased mediator is as effective as an unbiased one.

• Lundi 25 mai 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  SHMAYA Eran : *

• Lundi 18 mai 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  SMOLIN Alex (TSE) : *

• Lundi 27 avril 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  LOVO Stefano (HEC) : *

• Lundi 30 mars 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  RENOU Ludovic (QMUL) : *

• Lundi 16 mars 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  LEVY John : *

• Lundi 9 mars 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  KRÄHMER Daniel : *

• Lundi 2 mars 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  ZSELEVA Anna : *

• Lundi 27 janvier 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  MERTIKOPOULOS Panayotis : *

• Lundi 20 janvier 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  MATYSKOVA Ludmila : *

• Lundi 13 janvier 2020 11:00-12:00

  Institut Henri Poincaré - 11 rue Pierre et Marie Curie - 75005 Paris

  GAUJAL Bruno : *

• Lundi 16 décembre 2019 11:00-12:00

  Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  PAWLOWITSCH Christina (Université Panthéon-Assas, LEMMA) : Evolutionary dynamics of costly signaling

  Josef Hofbauer

  Résumé

  Costly-signaling games have a remarkably wide range of applications (education as a costly signal in the job market, handicaps as a signal for fitness in mate selection, politeness in language). The formal analysis of evolutionary dynamics in costly-signaling games has only recently gained more attention. In this paper, we study evolutionary dynamics in two basic classes of games with two states of nature, two signals, and two possible reactions in response to signals: a discrete version of Spence’s (1973) model and a discrete version of Grafen’s (1990) formalization of the handicap principle. We first use index theory to give a rough account of the dynamic stability properties of the equilibria in these games. Then, we study in more detail the replicator dynamics and to some extent the best-response dynamics.

• Lundi 9 décembre 2019 11:00-12:00

  Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  CORREA José (Universidad de Chile) : On the Price of Anarchy for flows over time

  Andres Cristi and Tim Oosterwijk

  Résumé

  Dynamic network flows, or network flows over time, constitute an important model for real-world situations where steady states are unusual, such as urban traffic and the Internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective. In this paper we study dynamic equilibria in the deterministic fluid queuing model in single-source single-sink networks, arguably the most basic model for flows over time. In the last decade we have witnessed significant developments in the theoretical understanding of the model. However, several fundamental questions remain open. One of the most prominent ones concerns the Price of Anarchy, measured as the worst case ratio between the minimum time required to route a given amount of flow from the source to the sink, and the time a dynamic equilibrium takes to perform the same task. Our main result states that if we could reduce the inflow of the network in a dynamic equilibrium, then the Price of Anarchy is exactly e/(e ? 1) ? 1.582. This significantly extends a result by Bhaskar, Fleischer, and Anshelevich (SODA 2011). Furthermore, our methods allow to determine that the Price of Anarchy in parallel-link networks is exactly 4/3. Finally, we argue that if a certain very natural monotonicity conjecture holds, the Price of Anarchy in the general case is exactly e/(e ? 1).

• Lundi 2 décembre 2019 11:00-12:00

  Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  GALICHON Alfred (New York University) : The equilibrium flow problem and multivocal gross substitutes

  Larry Samuelson and Lucas Vernet

  Résumé

  We show that several classical economic models such as two-sided matching models, min-cost flow problems, hedonic models, and dynamic programming problems are subcases of a more general class of problems called equilibrium flow problems. To analyze this problem, we introduce a novel notion of gross substitutes for correspondences called "multivocal gross substitutes". We show that this notion generalizes some familiar notions of substitutes (such as weak gross substitutes) while strengthening others (such as that of Kelso and Crawford). Our main result, the inverse isotonicity theorem, establishes that if an excess supply correspondence satisfies multivocal gross substitutes, then the inverse correspondence is isotone in the strong set order, extending to the corresponding case results by Berry, Gandhi and Haile (2013). As another consequence, extend the lattice structure results of Demange and Gale (1985) to general networks beyond the bipartite case.

• Lundi 25 novembre 2019 11:00-12:00

  Centre Emile Borel, Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  PREDTETCHINSKI Arkadi : Arkadi PREDTETCHINSKI

• Lundi 18 novembre 2019 11:30-12:30

  Centre Emile Borel, Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  MOULIN Hervé (University of Glasgow) : Toto

• Lundi 11 novembre 2019 11:00-12:00

  RADJA prenom ... : Test service info

• Lundi 4 décembre 2017 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  PRADELSKI Bary (ETH Zurich) : *

• Lundi 20 novembre 2017 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  CORREA José (Universidad de Chile) : *

• Lundi 6 novembre 2017 11:00-12:00

  Salle 01 (RDC), Centre Emile Borel, Institut Henri Poincaré, 11 rue Pierre et Marie Curie, 75005 Paris

  SAVANI Rahul (University of Liverpool ) : *

• Lundi 16 octobre 2017 11:00-12:00

  Salle 01 (RDC), Centre Emile Borel, Institut Henri Poincaré, 11 rue Pierre et Marie Curie, 75005 Paris

  SOLAN Eilan (Tel Aviv University ) : Optimal Dynamic Inspection

  Résumé

  We study a discounted repeated inspection game with two agents and one principal. Both agents may pro.fit by violating certain rules, while the principal can inspect on at most one agent in each period, in.flicting a punishment on an agent who is caught violating the rules. The goal of the principal is to minimize the discounted number of violations, and he has a Stackelberg leader advantage. We characterize the principal's optimal inspection strategy.

• Lundi 9 octobre 2017 11:00-12:00

  Salle 01 (RDC), Centre Emile Borel, Institut Henri Poincaré, 11 rue Pierre et Marie Curie, 75005 Paris

  MERTIKOPOULOS Panayotis : No-Regret Learning in Games

  Résumé

  In many cases of practical interest, the players of a repeated game may not know the structure of the game being played - simply think of commuters driving to work every day, ignorant of the number of commuters at each part of the road. In such cases, it is often assumed that players follow a no-regret procedure, i.e. an updating policiy that provably minimizes each player's individual regret against any possible play of their opponents. This talk focuses on the following question: does the sequence of play induced by a no-regret learning process converge to an equilibrium of the underlying stage game? I will present some recent contributions to this question (in both finite and continuous games), and I will discuss the impact of the feedback available to the players.

• Lundi 27 juin 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

• Lundi 20 juin 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

• Lundi 13 juin 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

• Lundi 6 juin 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  ZACCOUR Georges

  SCHROEDER Marc

• Lundi 30 mai 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

• Lundi 23 mai 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

• Lundi 9 mai 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  RITZBERGER Klaus

• Lundi 11 avril 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  SANTAMBROGIO

• Lundi 4 avril 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  LOVO Stefano

• Lundi 21 mars 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  QUINCAMPOIX Marc

• Lundi 14 mars 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  ZILIOTO Bruno

• Lundi 7 mars 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  RADY Sven

• Lundi 15 février 2016 11:15-12:15

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  MANNOR Shie (Technion) : Time Series Analysis Between stochastic and adversarial: forecasting with online ARMA model

• Lundi 15 février 2016 10:00-11:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  SOLAN Eilan (Tel Aviv) : Acceptable strategy profiles in stochastic games

• Lundi 8 février 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  HERNANDEZ Penelope (Valencia)

• Lundi 1er février 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

• Lundi 25 janvier 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  HEINRICH Max

• Lundi 18 janvier 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  FAURE Matthieu

• Lundi 11 janvier 2016 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  KLIMM Max

• Lundi 14 décembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  LESSARD Sabin

• Lundi 7 décembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  KANADE Varun (ENS) :

• Lundi 30 novembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  BABICHENKO Yakov :

• Lundi 23 novembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  PREDTETCHINSKI Arkadi : Optimal Stationary Strategies for lim sup Stochastic Games

• Lundi 16 novembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  JEHIEL Philippe : Investment strategy and selection bias: An equilibrium perspective on overconfidence

• Lundi 9 novembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  HART Sergiu (the Hebrew University of Jerusalem) : (1) The Query Complexity of Correlated Equilibria (with Noam Nisan), and (2) Smooth Calibration, Leaky Forecasts, and Finite Recall (with Dean P. Foster)

• Lundi 2 novembre 2015 11:00-12:00

  salle 01 (rez-de-chaussée) au Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pierre et Marie Curie, Paris 5ème

  WAN Cheng (University of Oxford) : Strategic decentralization in binary choice congestion games

• Lundi 3 décembre 2012 11:00-12:00

  Institut Henri Poincare 11, rue pierre et marie curie – 7500

  MENAGER Lucie (Universités Panthéon-Assas et Lille 1) : Strategic observation in bandit models

• Lundi 26 novembre 2012 11:00-12:00

  Institut Henri Poincare 11, rue pierre et marie curie – 7500

  TOIKKA Juuso Toikka (MIT) : Efficiency in games with markovian private information

• Lundi 26 novembre 2012 10:00-11:00

  Institut Henri Poincare 11, rue pierre et marie curie – 7500

  CARDALIAGUET Pierre (Université Paris Dauphine) : Some aspects of mean field games

• Lundi 19 novembre 2012 11:00-12:00

  Institut Henri Poincare 11, rue pierre et marie curie – 7500

  FLESCH Janos (Maastricht University) : On subgame-perfection in games with perfect information

• Lundi 12 novembre 2012 11:00-12:00

  Institute Henri Poincare - Centre Emile Borel - Salle 01 - r

  VIOSSAT Yannick (Université Paris Dauphine) : No-regret dynamics and fictitious-play

• Lundi 12 novembre 2012 11:00-12:00

  Institut Henri Poincare 11, rue pierre et marie curie – 7500

  VIOSSAT Yannick (Université Paris Dauphine) : No-regret dynamics and fictitious-play

• Lundi 17 septembre 2012 11:00-12:00

  Centre Emile Borel de l'Institut Henri Poincaré, 11 rue Pier

  WEINSTEIN Jonathan (Northwestern University) : Robustness in Repeated Games

• Lundi 30 avril 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  VENEL Xavier (TSE & Université Toulouse 1) : A distance for probability spaces and long-term values in Markov Decision Processes and Repeated Games.

  Co-author(s): J. Renault

• Lundi 2 avril 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  BALKENBORG Dieter (Exeter University) : Strict equilibrium sets

  Co-author(s): K. Schlag et D. Vermeulen

• Lundi 26 mars 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  KANDORI Michihiro (University of Tokyo) : Asynchronous Revision Games

• Lundi 19 mars 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  BRAVO Mario (Université Paris 6) : An Adjusted Payoff-Based Procedure for Normal Form Games

• Lundi 12 mars 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  VERMEULEN Dries (Maastricht University) : *

• Lundi 5 mars 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  LUGOSI Gabor (Pompeu Fabra University) : Regret in Online Combinatiorial Optimization

• Lundi 5 mars 2012 10:00-11:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  HAMADENE Said (Université du Maine) : Multi-players Nonzero-sum Dynkin Game in continuous time

• Lundi 30 janvier 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  LE TREUST Maël (Supélec) : Correlation and min-max levels in repeated games with imperfect monitoring

• Lundi 23 janvier 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  WOZNY Lukasz (Warsaw School of Economics) : A Constructive study of Markov equilibria in stochastic games with strategic complementarities

• Lundi 16 janvier 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  RIEDEL Frank (Bielefeld University) : Strategic use of ambiguity

• Lundi 9 janvier 2012 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  SCARSINI Marco (LUISS) : Monopoly pricing in the presence of social learning

• Lundi 12 décembre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  ETTINGER David (Université Paris-Dauphine) : o Deception in a repeated expert/agent interaction: theory and experiment

• Lundi 5 décembre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5 ou Salle 314 ou 201

  MORTIMORT David (PSE) : Aggregate Representations of Aggregate Games

  Co-author(s): Lars Stole

• Lundi 28 novembre 2011 11:00-12:00

  La séance a été annulée.

  Institut Henri Poincare - Salle 5, 314 ou 201

  MERTENS Jean-François (CORE, Université de Louvain) : Shapley value with a continuum of agents: stable bridges with index 1

• Lundi 21 novembre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  PERETZ Ron (Tel Aviv University) : The entropy method and repeated games with bounded complexity

• Lundi 14 novembre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  ZAPECHLNYUK Andriy (Queen Mary, Univ. of London) : Eliciting Information from a committee

• Lundi 7 novembre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  SCHLAG Karl (University of Vienna) : Decision Making in Uncertain and Changing Environments

• Lundi 7 novembre 2011 10:00-11:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  SKRETA Vasiliki (NYU) : Transparency and Commitment

• Lundi 31 octobre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  SEREA Oana (Université Paris 6) : Differential games and Zubov's method

• Lundi 24 octobre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  WAN Cheng (Université Paris 6) : Coalitions in nonatomic congestion games

• Lundi 17 octobre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  HORNER Johannes (Yale University) : Stationary equilibria in continuons-time games with private monitoring

• Lundi 10 octobre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  LACLAU Marie (HEC Paris) : Communication in repeated games played on a fixed network

• Lundi 3 octobre 2011 11:00-12:00

  Institut Henri Poincare - Salle 5, 314 ou 201

  OURY Marion (Université de Cergy) : Continuous implementation: a full characterization for finite environments

• Lundi 27 juin 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  CELIK Gorkem (ESSEC) : Reciprocal relationships and mechanism design

• Lundi 20 juin 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  ABDOU Joseph (Université Paris 1 Panthéon-Sorbonne) : Stability Index and Application to the Meet Game on a Lattice

• Lundi 6 juin 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  LASAULCE Samson (Supelec) : Multiuser channels and games

• Lundi 30 mai 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  TOMALA Tristan (HEC) : Belief-free communication equilibria in repeated games

• Lundi 23 mai 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  SUDDERTH William (University of Minnesota) : Perfect Information Games with Upper Semicontinuous Payoffs

• Lundi 16 mai 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  HERINGS Jean-Jaques (Maastricht University) : Stationary Equilibria in Stochastic Games: Structure, Selection, and Computation

• Lundi 9 mai 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  TERCIEUX Olivier (PSE) : Robust Equilibria in Sequential Games under Almost Common belief

• Lundi 2 mai 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  BLUME Andreas (University of Pittsburgh) : Language Barriers

  Co-auteur(s) : Oliver Board

  Résumé

  Different people use language in different ways. Private information about language competence can be used to re ect the idea that language is imperfectly shared. In optimal equilibria of common interest games there will generally be some benefit from communication with an imperfectly shared language, but the efficiency losses from private information about language competence in excess of those from limited competence itself may be significant. In optimal equilibria of common-interest sender-receiver games, private information about language competence distorts and drives a wedge between the indicative meanings of messages (the decision-relevant information indicated by those messages) and their imperative meanings (the actions induced by those messages). Indicative meanings are distorted because information about decision relevant information becomes confounded with information about the sender's language competence. Imperative meanings of messages become distorted because of the uncertain ability of the receiver to decode them. We show that distortions of meanings persist with higher-order failures of knowledge of language competence. In a richer class of games, where both senders and receivers move at the action stage and where payoffs violate a self-signaling condition, these distortions may result in complete communication failure for any finite-order knowledge of language competence.

  Texte intégral [pdf]

• Lundi 4 avril 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  FAURE Mathieu (Institut de mathématiques de Neuchâtel) : Stochastic Approximations, Differential Inclusions and consistency in games

• Lundi 28 mars 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  MARUTA Toshimasa (Nihon University) : Stochastically Stable Equilibria in n-person Binary Coordination Games

• Lundi 21 mars 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  RÜDIGER Jesper (Universidad Carlos III) : Biased Information Transmission

• Lundi 14 mars 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  JEHIEL Philippe (PSE) : Reputation with Analogical Reasoning

• Lundi 7 mars 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  SABOURIAN Hamid (University of Cambridge ) : Repeated Implementation

• Lundi 28 février 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  YOUNG Peyton (University of Oxford) : Efficiency and Equilibrium in Trial and Error Learning

• Lundi 7 février 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  LESLIE David (University of Bristol) : Controlled learning in games

• Lundi 31 janvier 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  BICH Philippe (Université Paris 1) : Relaxed Nash Equilibria of Discontinuous Games

• Lundi 24 janvier 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  SOLAN Eilon (Tel Aviv University) : Des jeux d'arrêt en temps continu

• Lundi 17 janvier 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  MATHIS Jérôme (TSE and University of Paris 8) : Entrusting Decision Making to Experts

• Lundi 10 janvier 2011 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  HALPERN Joe (Cornell University) : Beyond Nash Equilibrium: Solution Concepts for the 21st Century

• Lundi 13 décembre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  HAFER Catherine (New York University) : Institutions for Debate

  Co-auteur(s) : Dimitri Landa

• Lundi 6 décembre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  EHUD Kalai (Northwestern University) : Stability in large Games with Heterogeneouns Players

• Lundi 29 novembre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  FLESCH Janos (Maastricht University) : Strategic disclosure of random variables

• Lundi 22 novembre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  WEIBULL Jorgen (Stockholm School of Economics) : Robustness to Strategic Uncertainty

• Lundi 15 novembre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  RITZBERGER Klaus (University of Vienna) : Applications of Index Theory in Nash Equilibrium refinements

• Lundi 8 novembre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  CRESSMAN Ross (Wilfried Laurier University) : Game Experiments on Cooperation through Punishment or Reward

• Lundi 25 octobre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  HEIFETZ Aviad (Open University of Israel) : Comprehensive Rationalizability

• Lundi 18 octobre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  LAMBERT-MOGILIANSKY Ariane (PSE) : Games with Type Inderteminate Players: Strategic Manipulation of Preferences

• Lundi 11 octobre 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  BATTIGALLI PierPaolo (University of Bocconi) : Strategy and Interactive Beliefs in Dynamic Games

• Lundi 4 octobre 2010 11:00-12:00

  Institute Henri Poicaré - Salle 314 ou 201

  SOSIC Greys (University of Southern California) : Stable Group Purchasing Organizations

• Lundi 28 juin 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  KOESSLER Frederic (PSE-CNRS) : Using or Hiding Private Information? An Experimental Study of Zero-Sum Repeated Games with Incomplete Information

• Lundi 14 juin 2010 11:00-12:00

  Institut Henri Poincare - Salle 314 ou 201

  RENOU Ludovic (Univ. Leicester) : Ordients: optimizations and comparative statics without utility function

• Lundi 7 juin 2010 11:20-12:20

  Institut Henri Poincare - Salle 314 ou 201

  DZIUDA Wioletta (Northwestern University) : Ongoing Negotiation with Endogenous Status Quo

• Lundi 7 juin 2010 10:00-11:00

  Institut Henri Poincare - Salle 314 ou 201

  AMIR Rabah (Univ. Arizona) : Discounted stochastic games with strategic complementarities.

• Lundi 17 mai 2010 11:00-12:00

  Institut Henri Poincare Salle 314 ou 201

  DHILLON Amrita (Warwick University) : Corporate Control and Multiple Large shareholders

• Lundi 10 mai 2010 11:00-12:00

  Institut Henri Poincaré - Salle 314 ou 201

  TAKAHASHI Satoru (Princeton University) : Recursive Methods in Discounted Stochastic Games: An Algorithm for delta ?1 and a Folk Theorem

• Lundi 3 mai 2010 11:00-12:00

  IHP - Salle 314 ou 201

  KALAI Ehud (Northwestern University) : Engineering Cooperation in Two Player Strategic Games

• Lundi 12 avril 2010 11:00-12:00

  Institut Henri Poincare

  GENSBITTEL Fabien (Université Paris 1) : Asymptotic behavior of repeated games with incomplete information and a linear payoff

• Lundi 29 mars 2010 11:00-12:00

  Institut Henri Poincare

  SAMUELSON Larry (Yale University) : Pricing in Matching Markets.

• Lundi 22 mars 2010 11:00-12:00

  Institut Henri Poincare

  ARIELI Itai (Hebrew University of Jerusalem) : Infinite sequential games with incomplete information.

• Lundi 15 mars 2010 11:00-12:00

  Institut Henri Poincare

  VIDA Peter (University of Vienna) : Bidder-Optimal Signal Structure in a First Price Auction.

• 0000

  Voluntary confinement

  with Dominique Baril-Tremblay and Lucie Ménager

• 0000

  Salle 01 (RDC), Centre Emile Borel, Institut Henri Poincaré, 11 rue Pierre et Marie Curie, 75005 Paris

  MERTIKOPOULOS Panayotis : No-Regret Learning in Games

  Résumé

  Abstract: In many cases of practical interest, the players of a repeated game may not know the structure of the game being played - simply think of commuters driving to work every day, ignorant of the number of commuters at each part of the road. In such cases, it is often assumed that players follow a no-regret procedure, i.e. an updating policiy that provably minimizes each player's individual regret against any possible play of their opponents. This talk focuses on the following question: does the sequence of play induced by a no-regret learning process converge to an equilibrium of the underlying stage game? I will present some recent contributions to this question (in both finite and continuous games), and I will discuss the impact of the feedback available to the players.