Optimizing social welfare for network bargaining games in the face of instability, greed and idealism
From MaRDI portal
Publication:2195569
Recommendations
Cites work
- Bargaining dynamics in exchange networks
- Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Convergence of local dynamics to balanced outcomes in exchange networks
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
- Fast convergence of natural bargaining dynamics in exchange networks
- Fixed Points and Iteration of a Nonexpansive Mapping in a Banach Space
- scientific article; zbMATH DE number 4207369 (Why is no real title available?)
- scientific article; zbMATH DE number 5485541 (Why is no real title available?)
- scientific article; zbMATH DE number 41329 (Why is no real title available?)
- scientific article; zbMATH DE number 932401 (Why is no real title available?)
- Improved Distributed Approximate Matching
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Monotonicity in bargaining networks
- The bargaining problem
- The cooperative game theory foundations of network bargaining games
Cited in
(3)
This page was built for publication: Optimizing social welfare for network bargaining games in the face of instability, greed and idealism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195569)