Add to ORKGWe extend the non-cooperative game associated with the cost spanning tree problem introduced in Berganti¿nos and Lorenzo (2004) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong Nash equilibria of this game
In this paper we consider the connection game, a simple network design game with in-dependent selfis...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
Budget games are a variant of congestion games. In budget games, a player chooses a subset of resour...
We extend the noncooperative game associated with the cost spanning tree problem, introduced by Berg...
We associate to each cost spanning tree problem a non-cooperative game, which is inspired by a real-...
We study the Pareto optimal equilibria payoffs of the non-cooperative game associated with the cost ...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connect...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
Abstract. We consider a general class of non-cooperative buy-at-bulk cost sharing games, in which k ...
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking ...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
This paper addresses the optimization problem to maximize the total costs that can be shared among a...
In budget games, players compete over resources with finite budgets. For every resource, a player ha...
In this paper we consider the connection game, a simple network design game with in-dependent selfis...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
Budget games are a variant of congestion games. In budget games, a player chooses a subset of resour...
We extend the noncooperative game associated with the cost spanning tree problem, introduced by Berg...
We associate to each cost spanning tree problem a non-cooperative game, which is inspired by a real-...
We study the Pareto optimal equilibria payoffs of the non-cooperative game associated with the cost ...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connect...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
Abstract. We consider a general class of non-cooperative buy-at-bulk cost sharing games, in which k ...
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking ...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
This paper addresses the optimization problem to maximize the total costs that can be shared among a...
In budget games, players compete over resources with finite budgets. For every resource, a player ha...
In this paper we consider the connection game, a simple network design game with in-dependent selfis...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
Budget games are a variant of congestion games. In budget games, a player chooses a subset of resour...