Microeconomics
http://lists.repec.org/mailman/listinfo/nep-mic
Microeconomics
2021-04-19
Conï¬‚ict Prevention by Bayesian Persuasion
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2019-16_1&r=mic
Drawing upon the Bayesian persuasion literature, I show that a mediator can provide conï¬‚icting parties strategically with information to decrease the ex-ante war probability. In a conï¬‚ict between two parties with private information about military strength, the mediator generates information about each conï¬‚icting partyâ€™s strength and commits to sharing the obtained information with the respective opponent. The conï¬‚icting parties can be convinced not to ï¬ ght each other. The conï¬‚icting parties beneï¬ t from mediation, as the ex-ante war probability is reduced. The beneï¬ t is taken up by weak conï¬‚icting parties. This beneï¬ t is larger when war is costlier and when the war probability absent mediation is higher.
Raphaela Hennigs
mediation, conï¬‚ict, information design, Bayesian persuasion
2019-09
Double Marginalization and Vertical Integration
http://d.repec.org/n?u=RePEc:ces:ceswps:_8971&r=mic
Asymmetric information in procurement entails double marginalization. The phenomenon is most severe when the buyer has all the bargaining power at the production stage, while it vanishes when the buyer and suppliers’ weights are balanced. Vertical integration eliminates double marginalization and reduces the likelihood that the buyer purchases from independent suppliers. Conditional on market foreclosure, the probability that final consumers are harmed is positive only if the buyer has more bargaining power when selecting suppliers than when negotiating over quantities and intermediate prices. The buyer’s and consumers’ interests are otherwise aligned.
Philippe Choné
Laurent Linnemer
Thibaud Vergé
antitrust policy, vertical merger, asymmetric information, bargaining, double marginalization, procurement mechanism
2021
Preemption contests between groups
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2019-09&r=mic
We consider a preemption game between groups where the ï¬ rst agent to take a costly action wins the prize on behalf of his group. We describe the equilibrium solution of this problem when players diï¬€er in their own costs of action and these costs are private information. The equilibrium is typically characterized by delay. The nature of the equilibrium depends on key parameters such as the number of groups and their size. More competition between groups reduces delay, whereas in larger groups members of a given cost type are more reluctant to act but may yield an earlier resolution of the conï¬‚ict. We analyze asymmetries across groups, focusing on group size and strength of the externalities within groups.
Stefano Barbieri
Kai A. Konrad
David A. Malueg
preemption, free riding, dynamic conï¬‚ict, inter-group conï¬‚ict, dynamic conï¬‚ict, incomplete information, waiting
2019-05
Multiproduct Intermediaries
http://d.repec.org/n?u=RePEc:cwl:cwldpp:2263&r=mic
This paper develops a new framework for studying multiproduct intermediaries when consumers demand multiple products and face search frictions. We show that a multiproduct intermediary is profitable even when it does not improve consumer search efficiency. In its optimal product selection, it stocks high-value products exclusively to attract consumers to visit, then profits by selling non-exclusive products which are relatively cheap to buy from upstream suppliers. However, relative to the social optimum, the intermediary tends to be too big and stock too many products exclusively. As applications we use the framework to study the optimal design of a shopping mall, and the impact of direct-to-consumer sales by upstream suppliers on the retail market.
Makoto Watanabe
Jidong Zhou
Intermediaries, Multiproduct demand, Search, Direct-to-consumer sales, Product range, Exclusivity
2020-11
Bid Caps and Disclosure Policies
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2020-08&r=mic
We examine the eï¬€ect of publicly disclosing or concealing biddersâ€™ types in an all-pay auction with a common bid cap. We call partial (full) disclosure policy the setup where the contest designerâ€™s disclosure policy is (not) contingent on type realization. Despite a bid cap possibly increasing the expected expenditures under a partial disclosure policy and the expected expenditures of low-types under a policy of full disclosure, the bid cap unambiguously decreases the expected total expenditures, regardless of the disclosure policy. For any given bid cap and allowing for full and partial disclosure policies, we ï¬ nd that expenditures are minimized with the policy in which a designer discloses biddersâ€™ types only if both players have a low valuation of the prize. The expenditures are maximized with the full concealment policy or with the policy in which a designer discloses the information only if both players have a high valuation. All in all, when the designer can choose both the disclosure policy and the bid cap, revenue is maximized employing full concealment with no bid cap.
Bo Chen
Marco Serena
contest, all-pay auction, stochastic abilities, bid cap, disclosure
2020-06
A network solution to robust implementation: The case of identical but unknown distributions
http://d.repec.org/n?u=RePEc:upf:upfgen:1776&r=mic
We consider mechanism design environments in which agents commonly know that others' types are identically distributed, but without assuming that the actual distribution is common knowledge, nor that it is known to the designer (common knowledge of identicality, CKI). Under these assumptions, we study problems of partial and full implementation, as well as robustness. First, we characterize the transfers which are incentive compatible under the CKI assumption, and provide necessary and sufficient conditions for partial implementation. Second, we characterize the conditions under which full implementation is possible via direct mechanisms, as well as the transfer schemes which achieve full implementation whenever it is possible. We do this by pursuing a network approach, which is based on the observation that the full implementation problem in our setting can be conveniently transformed into one of designing a network of strategic externalities, subject to suitable constraints which are dictated by the incentive compatibility requirements entailed by the CKI assumption. This approach enables us to uncover a fairly surprising result: the possibility of full implementation is characterized by the strength of the preference interdependence of the two agents with the least amount of preference interdependence, regardless of the total number of agents, and of their preferences. Finally, we study the robustness properties of the implementing transfers with respect to both misspecifications of agents' preferences and with respect to lower orders beliefs in rationality.
Mariann Ollar
Antonio Penta
Moment conditions, robust full implementation, Rationalizability, interdependent values, identical but unknown distributions, uniqueness, strategic externalities, spectral radius, canonical transfers,
2021-04
Attack and Interception in Networks
http://d.repec.org/n?u=RePEc:ash:wpaper:57&r=mic
This paper studies a game of attack and interception in a network, where a single attacker chooses a target and a path, and each node chooses a level of protection. We show that the Nash equilibrium of the game exists and is unique. It involves a mixed strategy of the attacker except when one target has a very high value relative to others. We characterize equilibrium attack paths and attack distributions as a function of the underlying network and target values. We also show that adding a link or increasing the value of a target may harm the attacker - a comparative statics effect which is reminiscent of Braess's paradox in transportation economics. Finally, we contrast the Nash equilibrium with the equilibria of two variations of the model: one where nodes make sequential protection decisions upon observing the arrival of a suspicious object, and one where all nodes cooperate in defense.
Francis Bloch
Kalyan Chatterjee
Bhaskar Dutta
Network interdiction, Networks, Attack and defense, Inspection
2021-04
Optimal Epidemic Control in Equilibrium with Imperfect Testing and Enforcement
http://d.repec.org/n?u=RePEc:arx:papers:2104.04455&r=mic
We analyze equilibrium behavior and optimal policy within a Susceptible-Infected-Recovered epidemic model augmented with potentially undiagnosed agents who infer their health status and a social planner with imperfect enforcement of social distancing. We define and prove the existence of a perfect Bayesian Markov competitive equilibrium and contrast it with the efficient allocation subject to the same informational constraints. We identify two externalities, static (individual actions affect current risk of infection) and dynamic (individual actions affect future disease prevalence), and study how they are affected by limitations on testing and enforcement. We prove that a planner with imperfect enforcement will always wish to curtail activity, but that its incentives vanish as testing becomes perfect. When a vaccine arrives far into the future, the planner with perfect enforcement may encourage activity before herd immunity. We find that lockdown policies have modest welfare gains, whereas quarantine policies are effective even with imperfect testing.
Thomas Phelan
Alexis Akira Toda
2021-04
Fair Representation in Primaries: Heterogeneity and the New Hampshire Effect
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2020-07&r=mic
In sequential primaries, fair representation of the electorate may be undermined by the New Hampshire effect. Simultaneous primaries address fair representation, but may increase expenditures. We analyze these issues by studying heterogeneity in sequential and simultaneous contests. If a player is stronger in every battle (e.g., a candidate is favorite by the entire electorate), then expenditures are smaller in sequential than in simultaneous contests, as in the literature for homogeneous players, and the stronger player is more likely to win in sequential than simultaneous contests. However, if playersÂ’ advantages alternate across battles, then expenditures may be greater in sequential than in simultaneous contests, and the player who has the advantage later in sequential contest is more likely to win: dynamics affect representation. We interpret our results in light of the candidatesÂ’advantages due to statesÂ’ demographics in the 2020 US primaries and discuss novel testable implications of our analysis.
Stefano Barbieri
Marco Serena
contests, momentum effect, temporal structures.
2020-06
Belief Convergence under Misspecified Learning: A Martingale Approach
http://d.repec.org/n?u=RePEc:cwl:cwldpp:2235r&r=mic
We present an approach to analyze learning outcomes in a broad class of misspecified environments, spanning both single-agent and social learning. We introduce a novel "prediction accuracy" order over subjective models, and observe that this makes it possible to partially restore standard martingale convergence arguments that apply under correctly specified learning. Based on this, we derive general conditions to determine when beliefs in a given environment converge to some long-run belief either locally or globally (i.e., from some or all initial beliefs). We show that these conditions can be applied, first, to unify and generalize various convergence results in previously studied settings. Second, they enable us to analyze environments where learning is "slow," such as costly information acquisition and sequential social learning. In such environments, we illustrate that even if agents learn the truth when they are correctly specified, vanishingly small amounts of misspecification can generate extreme failures of learning.
Mira Frick
Ryota Iijima
Yuhta Ishii
Misspecified learning, Stability, Robustness, Berk-Nash equilibrium
2020-05
Winner's Effort Maximization in Large Contests
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2020-13&r=mic
We investigate the temporal structure that maximizes the winner's effort in large homogeneous contests, thus extending Hinnosaar (2019)'s analysis of total effort. We find that the winner's effort ranges from a lower bound of 0 to an upper bound of one third of the value of the prize, depending on the temporal structure; the upper (lower) bound is reached with an infinite number of players playing sequentially (simultaneously) in the first periods (period). This is in line with Hinnosaar's results for total effort. Nevertheless, when compare the speed of convergence of different temporal structures to the upper bound for the winner's effort, we prove the suboptimality of the fully sequential temporal structure, which is dominated by an initial number of fully sequential moves and a greater number of fully simultaneous moves in the very last period. This is in contrast with Hinnosaar's results for total effort.
Stefano Barbieri
Marco Serena
2020-09
Conservative Updating
http://d.repec.org/n?u=RePEc:arx:papers:2102.00152&r=mic
This paper provides a behavioral analysis of conservatism in beliefs. I introduce a new axiom, Dynamic Conservatism, that relaxes Dynamic Consistency when information and prior beliefs "conflict." When the agent is a subjective expected utility maximizer, Dynamic Conservatism implies that conditional beliefs are a convex combination of the prior and the Bayesian posterior. Conservatism may result in belief dynamics consistent with confirmation bias, representativeness, and the good news-bad news effect, suggesting a deeper behavioral connection between these biases. An index of conservatism and a notion of comparative conservatism are characterized. Finally, I extend conservatism to the case of an agent with incomplete preferences that admit a multiple priors representation.
Matthew Kovach
2021-01
Characterization of Nash equilibria in Cournotian oligopolies with interdependent preferences
http://d.repec.org/n?u=RePEc:mib:wpaper:463&r=mic
We study the effects on the Nash equilibrium of the presence of a structure of social interdependent preferences in a Cournot oligopoly, described in terms of a game in which the network of interactions reflects on the utility functions of firms through a combination of weighted profits of their competitors as in [7]. Taking into account the channels of social and market interactions, we detail the consequence of preference interdependence on the best response of a firm, focusing on both direct and high degree of interdependence effects between two given firms. We characterize the Nash equilibrium in terms of social and market interactions among firms, through a Bonacich-like centrality measure and a scalar index describing the degree of competitiveness that characterizes an oligopoly with interdependent preferences. Finally, we study the equilibrium of some scenarios described by regular structures of interaction.
Marco F. Boretto
Fausto Cavalli
Ahmad Naimzada
Cournot Game, Preference interdependence, Nash Equilibrium
2021-03
Contests with Supporters
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2019-08&r=mic
In many real-world contests ( political elections / lobbying for public projects), contestants try to engage supporters (unemployed youth / local residents) to fight for them. Such contests have the following features: a significant part of a contestantâ€™s supporter compensation is contingent upon the contestant winning the contest, and supporters are (at least partially) mercenary in that higher compensation offers do induce them to switch allegiance away from a â€˜like-mindedâ€™ contestant. We study a class of contests with the above features, where two contestants â€“ a favourite and an underdog â€“ recruit supporters by offering contingent (and non-contingent) compensations in cash or in excludable public goods like political access. Our analysis delineates contest equilibria with the following features: Contestantsâ€™ offers of contingent compensations force potential supporters to choose their allegiance on the basis of predicted winners â€“ and that act, in and of itself, enables the favourite to extend her lead. In some cases, it is possible that the underdog is doubly disadvantaged â€“ her total compensation bill is no less than the favouriteâ€™s though she manages to attract a smaller army of supporters and thus falls farther behind in the race. The contest is necessarily dissipative for the underdog: she would be strictly better off under a ban on the hiring of supporters (though she is the one who offers higher supporter compensation). In some cases, the availability of unemployed youth to act as supporters in contests causes everyone in the economy to lose (except, maybe, the supporters themselves).
Bharat Goel
Arijit Sen
Contests, supporters, elections, lobbying
2019-05
Comparative statics and centrality measures in oligopolies with interdependent preferences
http://d.repec.org/n?u=RePEc:mib:wpaper:464&r=mic
Considering the Cournot oligopoly with interdependent preferences proposed in [5], we analyze the effects of a change in the network of social interactions. Reconsidering some of the main centrality measures proposed in the literature, we show how intercentrality, Bonacich and Friedkin-Johnsen centrality measures can be related in a network described by a general matrix of interaction. This allows showing under what conditions a firm can benefit, in terms of equilibrium performance, from a change in the weight of interaction with respect to one of its competitors. Extending the approach to the study of a uniform change in the behavior of all the firms, we show that it is collectively beneficial only if the structure of social interaction is characterized by a sufficient degree of homogeneity in terms of weight distributions.
Marco F. Boretto
Fausto Cavalli
Ahmad Naimzada
Cournot Game, Preference interdependence, Network, Centrality measures, Comparative statics.
2021-03
Optimal Design of Limited Partnership Agreements
http://d.repec.org/n?u=RePEc:arx:papers:2104.07049&r=mic
General partners (GP) are sometimes paid on a deal-by-deal basis and other times on a whole-portfolio basis. When is one method of payment better than the other? I show that when assets (projects or firms) are highly correlated or when GPs have low reputation, whole-portfolio contracting is superior to deal-by-deal contracting. In this case, by bundling payouts together, whole-portfolio contracting enhances incentives for GPs to exert effort. Therefore, it is better suited to alleviate the moral hazard problem which is stronger than the adverse selection problem in the case of high correlation of assets or low reputation of GPs. In contrast, for low correlation of assets or high reputation of GPs, information asymmetry concerns dominate and deal-by-deal contracts become optimal, as they can efficiently weed out bad projects one by one. These results shed light on recent empirical findings on the relationship between investors and venture capitalists.
Mohammad Abbas Rezaei
2021-04
Attacking and Defending Multiple Valuable Secrets in a Big Data World
http://d.repec.org/n?u=RePEc:mpi:wpaper:tax-mpg-rps-2019-05&r=mic
This paper studies the attack-and-defence game between a web user and a whole set of players over this userâ€™s â€˜valuable secrets.â€™ The number and type of these valuable secrets are the userâ€™s private information. Attempts to tap information as well as privacy protection are costly. The multiplicity of secrets is of strategic value for the holders of these secrets. Users with few secrets keep their secrets private with some probability, even though they do not protect them. Users with many secrets protect their secrets at a cost that is smaller than the value of the secrets protected. The analysis also accounts for multiple redundant information channels with cost asymmetries, relating the analysis to attack-and-defence games with a weakest link.
Kai A. Konrad
OR in societal problem analysis, big-data, privacy, web user, conï¬‚ict, information rents, valuable secrets, attack-and-defence, multiple attackers, multiple defence items, multi-front contest.
2019-05
Motivational Ratings
http://d.repec.org/n?u=RePEc:hal:wpaper:hal-03187510&r=mic
Performance evaluation (\rating") systems not only provide information to users but also motivate the rated worker. This paper solves for the optimal(effort-maximizing) rating within the standard career concerns framework. We prove that this rating is a linear function of past observations. The rating, however, is not a Markov process, but rather the sum of two Markov processes. We show how it combines information of different types and vintages. An increase in effort may adversely affect some (but not all) future ratings.
Johannes Hörner
Nicolas Lambert
Career Concerns,Mechanism Design,Ratings.
2021-04-01
Reward Design in Risk-Taking Contests
http://d.repec.org/n?u=RePEc:arx:papers:2102.03417&r=mic
Following the risk-taking model of Seel and Strack, $n$ players decide when to stop privately observed Brownian motions with drift and absorption at zero. They are then ranked according to their level of stopping and paid a rank-dependent reward. We study the problem of a principal who aims to induce a desirable equilibrium performance of the players by choosing how much reward is attributed to each rank. Specifically, we determine optimal reward schemes for principals interested in the average performance and the performance at a given rank. While the former can be related to reward inequality in the Lorenz sense, the latter can have a surprising shape.
Marcel Nutz
Yuchong Zhang
2021-02
Too Big to Prevail: The Paradox of Power in Coalition Formation
http://d.repec.org/n?u=RePEc:ces:ceswps:_8980&r=mic
In standard coalition games, players try to form a coalition to secure a prize and a coalition agreement specifies how the prize is to be split among its members. However, in practical situations where coalitions are formed, the actual split of the prize often takes place after the coalition formation stage. This creates the possibility for some players to ask for a renegotiation of the initial split. We predict that, in such situations, a player can suffer from being “too strong”. Our experimental results confirm that, when the actual split of the prize is delayed, a player’s strength can turn into a strategic disadvantage: a greater voting power in forming a winning coalition is undermined by the threat of being overly powerful at the stage when a split is determined. This result is relevant to many real world situations where “too strong” players find it paradoxically hard to partner with weaker players to win the game.
Changxia Ke
Florian Morath
Anthony Newell
Lionel Page
Shapley Value, (non) binding agreement, balance of power, communication
2021