- Published 2013 in ESA
DOI:10.1007/978-3-642-40450-4_37

We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for these games. In addition, we prove that an instance has a balanced solution if and only if it has a stable one. Our… (More)

### Presentations referencing similar topics