Minimum cost stability in exchange networks
From MaRDI portal
Publication:2279739
Recommendations
Cites work
- A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
- Bargaining dynamics in exchange networks
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Contribution games in networks
- Contribution Games in Social Networks
- Efficient algorithms for finding maximum matching in graphs
- Efficient stabilization of cooperative matching games
- Fast convergence of natural bargaining dynamics in exchange networks
- Finding small stabilizers for unstable graphs
- Friendship and stable matching
- scientific article; zbMATH DE number 5485541 (Why is no real title available?)
- Mining hidden links in social networks to achieve equilibrium
- Paths, Trees, and Flowers
- Social exchange networks with distant bargaining
- The bargaining problem
This page was built for publication: Minimum cost stability in exchange networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279739)