25 citations · 40 across the 13 of their papers we have counts for
6 papers · 1 filter
Sequential Solutions in Machine Scheduling Games
Cong Chen, Paul Giessler, Akaki Mamageishvili +2
We consider the classical machine scheduling, where jobs need to be scheduled on machines, and where job scheduled on machine contributes to…
Bribeproof mechanisms for two-values domains
Matúš Mihalák, Paolo Penna, Peter Widmayer
Schummer (Journal of Economic Theory 2000) introduced the concept of bribeproof mechanism which, in a context where monetary transfer between agents is possible, requires that mani…
Multicast Network Design Game on a Ring
Akaki Mamageishvili, Matus Mihalak
In this paper we study quality measures of different solution concepts for the multicast network design game on a ring topology. We recall from the literature a lower bound of 4/3…
An Upper Bound on the Price of Stability of Undirected Network Design Games
Akaki Mamageishvili, Matúš Mihalák, Simone Montemezzani
In the network design game with players, every player chooses a path in an edge-weighted graph to connect her pair of terminals, sharing costs of the edges on her path with all…
Tree Nash Equilibria in the Network Creation Game
Akaki Mamageishvili, Matus Mihalak, Dominik Muller
In the network creation game with n vertices, every vertex (a player) buys a set of adjacent edges, each at a fixed amount α > 0. It has been conjectured that for α >= n, every Nas…
Improving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
In this paper we show that the price of stability of Shapley network design games on undirected graphs with k players is at most (k^3(k+1)/2-k^2) / (1+k^3(k+1)/2-k^2) H_k = (1 - Θ(…