Complexity of stability in trading networks
Efficient computability is an important property of solution concepts. We consider the computational complexity of finding and verifying various solution concepts in trading networks—multi-sided matching markets with bilateral contracts and without transferable utility—under the assumption of full s...
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | Journal article |
| اللغة: | English |
| منشور في: |
Springer Nature
2023
|