Graphs inducing totally balanced and submodular Chinese postman games
From MaRDI portal
Publication:2449131
DOI10.1016/j.dam.2014.03.002zbMath1288.05171MaRDI QIDQ2449131
Herbert Hamers, M. Josune Albizuri
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.002
91A12: Cooperative games
91A43: Games involving graphs
05C57: Games on graphs (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On graphs which can or cannot induce Chinese Postman games with a non-empty core
- Population monotonic allocation schemes for cooperative games with transferable utility
- On the concavity of delivery games
- Cost allocation in the Chinese postman problem
- On the equivalence between some local and global Chinese postman and traveling salesman graphs
- Submodularity of some classes of the combinatorial optimization games
- Totally balanced combinatorial optimization games
- On some balanced, totally balanced and submodular delivery games
- Cores of convex games
- The kernel and bargaining set for convex games
- Matching, Euler tours and the Chinese postman