Search results for "Subgame"
showing 8 items of 8 documents
Strategic sharing of a costly network
2012
We study minimum cost spanning tree problems for a set of users connected to a source. Prim’s algorithm provides a way of finding the minimum cost tree mm. This has led to several definitions in the literature, regarding how to distribute the cost. These rules propose different cost allocations, which can be understood as compensations and/or payments between players, with respect to the status quo point: each user pays for the connection she uses to be linked to the source. In this paper we analyze the rationale behind a distribution of the minimum cost by defining an a priori transfer structure. Our first result states the existence of a transfer structure such that no user is willing to …
NASH EQUILIBRIA IN A MODEL OF MULTIPRODUCT PRICE COMPETITION: AN ASSIGNMENT PROBLEM
2003
We study the market interaction of a finite number of single-product firms and a representative buyer, where the buyer consumes bundles of these goods. The buyers' value function determines their willingness to pay for subsets of goods. We show that subgame perfect Nash-equilibrium outcomes are solutions of the linear relaxation of an integer programming assignment problem and that they always exits. The (subgame perfect) Nash-equilibrium price set is characterized by the Pareto frontier of the associated dual problem's projection on the firms' price vectors. We identify the Nash-equilibrium prices for monotonic buyers' value functions and, more importantly, we show that some central soluti…
Multiproduct trading with a common agent under complete information: Existence and characterization of Nash equilibrium
2014
This paper focuses on oligopolistic markets in which indivisible goods are sold by multiproduct firms to a continuum of homogeneous buyers, with measure normalized to one, who have preferences over bundles of products. Our analysis contributes to the literature on private, delegated agency games with complete information, extending the insights by Chiesa and Denicolò (2009) to multiproduct markets with indivisibilities and where the agent's preferences need not be monotone. By analyzing a kind of extended contract schedules -mixed bundling prices- that discriminate on exclusivity, the paper shows that efficient equilibria always exist in such settings. There may also exist inefficient equil…
The equal collective gains value in cooperative games
2021
AbstractThe property of equal collective gains means that each player should obtain the same benefit from the cooperation of the other players in the game. We show that this property jointly with efficiency characterize a new solution, called the equal collective gains value (ECG-value). We introduce a new class of games, the average productivity games, for which the ECG-value is an imputation. For a better understanding of the new value, we also provide four alternative characterizations of it, and a negotiation model that supports it in subgame perfect equilibrium.
Delegated agency in multiproduct oligopolies with indivisible goods
2010
This paper focuses on oligopolistic markets in which indivisible goods are sold by multiproduct firms to a continuum of homogeneous buyers, with measure normalized to one, who have preferences over bundles of products. Our analysis contributes to the literature on delegated agency games with direct externalities and complete information, extending the insights by Berheim and Whinston (1986, a , b) to markets with indivisibilities. By analyzing a kind of extended contract schedules - mixed bundling prices - that discriminate on exclusivity, the paper shows that efficient equilibria always exist in such settings. There may also exist inefficient equilibria in which the agent chooses a subopti…
Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application
2008
We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…
A non-cooperative approach to the folk rule in minimum cost spanning tree problems
2023
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning tree problem between the players. A rule that assigns a payoff to each player provides this distribution. An optimistic point of view is considered to devise a cooperative game. Following this optimistic approach, a sequential game provides this construction to define the action sets of the players. The main result states the existence of a unique cost allocation in subgame perfect equilibria. This cost allocation matches the one suggested by the folk rule. The authors thank the support of the Spanish Ministry of Science, Innovation and Universities, the Spanish Ministry of Economy and Compe…
Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity
2018
Abstract This paper focuses on multiproduct trading with indivisibilities and where a representative agent may have non-monotonic preferences. In this framework, the set of firms’ profits (which comes from efficient subgame perfect Nash equilibria) is the Pareto frontier of some projection of the core of the game. We show that under monotonicity efficient subgame perfect Nash equilibria are achieved by single offers and the equilibrium characterization is easy to obtain. When dealing with non-monotonic preferences the problem becomes more challenging. Then, we define a pair of primal–dual linear programming problems that fully identifies the core of the game. A set of modified versions of t…