Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Network Bargaining"”.

  1. Vertex Stabilizers for Network Bargaining Games

    Network bargaining games form a prominent class of examples of game theory problems defined on graphs, where vertices represent players, and edges represent their possible interactions. An instance of a \emph{network bargaining game} is given by a graph $G = (V, E)$ with edge weights $w \in …

    waterloo Repository record for Vertex Stabilizers for Network Bargaining Games (opens in a new tab)

  2. Network Bargaining: Creating Stability Using Blocking Sets

    Bargaining theory seeks to answer the question of how to divide a jointly generated surplus between multiple agents. John Nash proposed the Nash Bargaining Solution to answer this question for the special case of two agents. Kleinberg and Tardos extended this idea to network games, and introduced a …

    waterloo Repository record for Network Bargaining: Creating Stability Using Blocking Sets (opens in a new tab)

  3. Stabilizing Weighted Graphs

    … some interesting game theory problems, such as network bargaining games and cooperative matching games, because they characterize instances which admit stable outcomes. Motivated by this, in the last few years many researchers have investigated the algorithmic problem of turning a given graph …

    waterloo Repository record for Stabilizing Weighted Graphs (opens in a new tab)

  4. Matchings and games on networks

    … solution concepts for different models of network games. In chapter 3 we study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We fully characterize the existence of balanced solutions and …

    waterloo Repository record for Matchings and games on networks (opens in a new tab)