scientific article; zbMATH DE number 7376010
From MaRDI portal
Publication:5002762
DOI10.4230/LIPIcs.ICALP.2018.83zbMath1499.05258MaRDI QIDQ5002762
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hierarchical games (including Stackelberg games) (91A65) Linear programming (90C05) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient stabilization of cooperative matching games
- The complexity of König subgraph problems and above-guarantee vertex cover
- Computing solutions for matching games
- Finding small stabilizers for unstable graphs
- Network bargaining: using approximate blocking sets to stabilize unstable instances
- Solutions for the stable roommates problem with payments
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- The assignment game. I: The core
- Stabilizing Network Bargaining Games by Blocking Players
- On the power of unique 2-prover 1-round games
- Integer and Fractional Matchings
- Vertex packings: Structural properties and algorithms
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Paths, Trees, and Flowers
This page was built for publication:
