nep-gth New Economics Papers
on Game Theory
Issue of 2017‒03‒26
ten papers chosen by
László Á. Kóczy
Magyar Tudományos Akadémia

  1. Formation of coalition structures as a non-cooperative game By Dmitry Levando
  2. Efficiency and Voluntary Redistribution under Inequality By Masaki Aoyagi; Naoko Nishimura; Yoshitaka Okano
  3. Information Transmission in Hierarchies By Simon Schopohl
  4. Public debt, corruption and tax evasion: Nash and Stackelberg equilibria By Halkos, George; Papageorgiou, George
  5. Constrained Allocation of Projects to Heterogenous Workers with Preferences over Peers By Flip Klijn
  6. Revenue ranking of optimally biased contests: the case of two players By Christian Ewerhart
  7. Information transmission in hierarchies By Schopohl, Simon
  8. Targeted campaign competition, loyal voters, and supermajorities By Pierre C. Boyer; Kai A. Konrad; Brian Roberson
  9. Uncertain acts in games By Riedel, Frank
  10. Providing Efficient Network Access to Green Power Generators : A Long-term Property Rights Perspective By Petropoulos, G.; Willems, Bert

  1. By: Dmitry Levando (National Research University Higher School of Economics)
    Abstract: The paper defines a family of nested non-cooperative simultaneous finite games to study coalition structure formation with intra and inter-coalition externalities. Every game has two outcomes - an allocation of players over coalitions and a payoff profile for every player. Every game in the family has an equilibrium in mixed strategies. The equilibrium can generate more than one coalition with a presence of intra and inter group externalities. These properties make it different from the Shapley value, strong Nash, coalition-proof equilibrium, core, kernel, nucleolus. The paper demonstrates some applications: non-cooperative cooperation, Bayesian game, stochastic games and construction of a non-cooperative criterion of coalition structure stability for studying focal points. An example demonstrates that a payoff profile in the Prisoners' Dilemma is non-informative to deduce a cooperation of players
    Keywords: Non-cooperative Games
    JEL: C71 C72 C73
    Date: 2017–02
    URL: http://d.repec.org/n?u=RePEc:mse:cesdoc:17015&r=gth
  2. By: Masaki Aoyagi; Naoko Nishimura; Yoshitaka Okano
    Abstract: This paper presents an experimental analysis of two-by-two coordination games in which player 1 earns a substantially higher payoff than player 2 except in the inefficient equilibrium where they earn the same payoffs. The main focus is on the comparison of two treatments with and without the ex post redistribution stage in which both players may voluntarily transfer their payoffs earned in the game to the other player. We find that (1) the transfer opportunity raises the probability of coordination on an efficient equilibrium, (2) a transfer from player 1 to player 2 is positive, and is higher when player 2 chooses the action corresponding to the efficient equilibrium, and hence (3) the transfer opportunity tends to improve the efficiency and equity of the final outcome. Furthermore, these tendencies are stronger when the two players have conflicting interests over the two equilibria than when they have common interests.
    Date: 2017–03
    URL: http://d.repec.org/n?u=RePEc:dpr:wpaper:0992&r=gth
  3. By: Simon Schopohl (EDEEM - Université Paris 1, Universität Bielefeld and Université Catholique de Louvain)
    Abstract: We analyze a game in which players with unique information are arranged in a hierarchy. In the lowest layer each player can decide in each of several rounds either to pass the information to his successor or to hold. While passing generates an immediate payoff according to the value of information, the player can also get an additional reward if he is the last player to pass. Facing this problem while discounting over time determines the player's behavior. Once a successor has collected all information from his workers he starts to play the same game with his successor. We state conditions for different Subgame Perfect Nash Equilibria and analyse the time it takes each hierarchy to centralize the information. This allows us to compare different structures and state which structure centralizes fastest depending on the information distribution and other parameters. We show that the time the centralization takes is mostly affected by the least informed players
    Keywords: communication network; dynamic network game; hierarchical structure; information transmission
    JEL: D83 C72 C73
    Date: 2017–02
    URL: http://d.repec.org/n?u=RePEc:mse:cesdoc:17014&r=gth
  4. By: Halkos, George; Papageorgiou, George
    Abstract: Public debt accumulation results to disutility with the problem addressed as whether time path of the public debt is sustainable. In this study the infinite time differential game modeling is used as appropriate tool for the economic analysis that follows. The dynamic game is simple and assumes that the starting point of the public debt model is the well known accounting identity interrelating public debt, interest rate and real government surplus exclusive of interest payments on public debt. In the setting, we consider as stock the public debt and the stress of the regulator is to raise nation’s primary surplus. Any surplus increase is not only dependent on government measures, but is also dependent on the known “culture of corruption” and on tax evasion. Thus the process of surpluses’ augmentation should be a function of these two factors. Nash and Stackelberg differential game approaches are used to explore strategic interactions. In the Nash equilibrium establishment of cyclical strategies during the game between the group of people involved in illegal activities of corruption and tax evasion in one hand and the government in the other, requires that the discount rate of the group of people involved in illegal actions must be greater than government’s discount rate. That is the group of corrupt officials and evaders must be more impatient than government. In the case of hierarchical setting analytical expressions of the strategies and the steady state value of public debt stock are provided. Furthermore a number of propositions are stated.
    Keywords: Public debt; Tax evasion; Dynamic games; Nash equilibrium; Stackelberg equilibrium
    JEL: C72 H26 H62 H63
    Date: 2017–03
    URL: http://d.repec.org/n?u=RePEc:pra:mprapa:77519&r=gth
  5. By: Flip Klijn
    Abstract: We study the problem of allocating projects to heterogenous workers. The simultaneous execution of multiple projects imposes constraints across project teams. Each worker has preferences over the combinations of projects in which he can potentially participate and his team members in any of these projects. We propose a revelation mechanism that is Pareto-efficient and group strategy-proof (Theorem 1). We also identify two preference domains on which the mechanism is strongly group strategy-proof (Theorem 2). Our results subsume results by Monte and Tumennasan (2013) and Kamiyama (2013).
    Keywords: matching; allocation; heterogenous agents; preferences over peers; efficiency; (group) strategy-proofness
    JEL: C78 D61 D78 I20
    Date: 2017–03
    URL: http://d.repec.org/n?u=RePEc:bge:wpaper:960&r=gth
  6. By: Christian Ewerhart
    Abstract: It is shown that the equilibrium in the asymmetric Tullock contest is unique for parameter values r ≤ 2. This allows proving a revenue ranking result saying that a revenue-maximizing designer capable of biasing the contest always prefers a contest technology with higher accuracy.
    Keywords: Tullock contest, Nash equilibrium, heterogeneous valuations, discrimination
    JEL: C72 D72 J71
    Date: 2017–03
    URL: http://d.repec.org/n?u=RePEc:zur:econwp:243&r=gth
  7. By: Schopohl, Simon (Center for Mathematical Economics, Bielefeld University)
    Abstract: We analyze a game in which players with unique information are arranged in a hierarchy. In the lowest layer each player can decide in each of several rounds either to pass the information to his successor or to hold. While passing generates an immediate payoff according to the value of information, the player can also get an additional reward if he is the last player to pass. Facing this problem while discounting over time determines the player’s behavior. Once a successor has collected all information from his workers he starts to play the same game with his successor. We state conditions for different Subgame Perfect Nash Equilibria and analyse the time it takes each hierarchy to centralize the information. This allows us to compare different structures and state which structure centralizes fastest depending on the information distribution and other parameters. We show that the time the centralization takes is mostly affected by the least informed players.
    Keywords: communication network, dynamic network game, hierarchical structure, information transmission
    Date: 2017–03–14
    URL: http://d.repec.org/n?u=RePEc:bie:wpaper:570&r=gth
  8. By: Pierre C. Boyer (CREST, Ecole Polytechnique, Universit´e Paris-Saclay, Route de Saclay, 91128 Palaiseau, France); Kai A. Konrad (Max Planck Institute for Tax Law and Public Finance); Brian Roberson (Purdue University, Department of Economics, Krannert School of Management)
    Abstract: We consider campaign competition in which candidates compete for votes among a continuum of voters by engaging in persuasive efforts that are targetable. Each individual voter is persuaded by campaign effort and votes for the candidate who targets more persuasive effort to this voter. Each candidate chooses a level of total campaign effort and allocates their effort among the set of voters. We completely characterize equilibrium for the majoritarian objective game and compare that to the vote-share maximizing game. If the candidates are symmetric ex ante, both types of electoral competition dissipate the rents from office in expectation. However, the equilibria arising under the two electoral objectives qualitatively differ. In majoritarian elections, candidates randomize over their level of total campaign effort, which provides support for the puzzling phenomenon of the emergence of supermajorities in majoritarian systems. Vote-share maximization leads to an equilibrium in which both candidates make deterministic budget choices and reach a precise fifty-fifty split of vote shares. We also study how asymmetry between the candidates affects the equilibrium. If some share of the voters is loyal to one of the candidates, then both candidates expend the same expected efforts in equilibrium, but the advantaged candidate wins with higher probability for majoritarian voting or a higher share of voters for vote-share maximization.
    Keywords: Campaign competition; continuous General Lotto game; vote buying; flexible budgets; supermajorities, loyal voters.
    JEL: D72 D78 D82
    Date: 2017
    URL: http://d.repec.org/n?u=RePEc:chu:wpaper:17-03&r=gth
  9. By: Riedel, Frank (Center for Mathematical Economics, Bielefeld University)
    Abstract: This text reviews a recent approach to modeling "radically uncertain" behavior in strategic interactions. By rigorously rooting the approach in decision theory, we provide a foundation for applications of Knightian uncertainty in mechanism design, principal agent and moral hazard models. We discuss critical assessments and provide alternative interpretations of the new equilibria in terms of equilibrium in beliefs, and as a boundedly rational equilibrium in the sense of a population equilibrium. We also discuss the purification of equilibria in the spirit of Harsanyi.
    Keywords: Knightian Uncertainty in Games, Strategic Ambiguity, Ellsberg Games, Purification
    Date: 2017–03–15
    URL: http://d.repec.org/n?u=RePEc:bie:wpaper:571&r=gth
  10. By: Petropoulos, G.; Willems, Bert (Tilburg University, Center For Economic Research)
    Abstract: Coordinating the timing of new production facilities is one of the challenges of liberalized power sectors. It is complicated by the presence of transmission bottlenecks, oligopolistic competition and the unknown prospects of low-carbon technologies. We build a model encompassing a late and early investment stage, an existing dirty (brown) and a future clean (green) technology and a single transmission bottleneck, and compare dynamic efficiency of several market designs. Allocating network access on a short-term competitive basis distorts investment decisions, as brown firms will preempt green competitors by investing early. Dynamic efficiency is restored with long-term transmission rights that can be traded on a secondary market. We show that dynamic efficiency does not require the existence of physical rights for accessing the transmission line, but financial rights on receiving the scarcity revenues generated by the transmission line suffice.
    Keywords: network access; congestion management; renewable energy sources; power markets
    JEL: L94 L13 C72 D43
    Date: 2017
    URL: http://d.repec.org/n?u=RePEc:tiu:tiucen:6d7117f0-0893-4db9-a668-ccbb7a977526&r=gth

This nep-gth issue is ©2017 by László Á. Kóczy. It is provided as is without any express or implied warranty. It may be freely redistributed in whole or in part for any purpose. If distributed in part, please include this notice.
General information on the NEP project can be found at http://nep.repec.org. For comments please write to the director of NEP, Marco Novarese at <director@nep.repec.org>. Put “NEP” in the subject, otherwise your mail may be rejected.
NEP’s infrastructure is sponsored by the School of Economics and Finance of Massey University in New Zealand.