On graphs which can or cannot induce Chinese Postman games with a non-empty core

DOI10.1016/J.DAM.2012.04.002zbMath1246.05102OpenAlexW2038047385MaRDI QIDQ442225

Frieda Granot, Daniel Granot

Publication date: 10 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.002

zbMATH Keywords

corecost allocationcooperative gamechinese postman

Mathematics Subject Classification ID

Cooperative games (91A12) Structural characterization of families of graphs (05C75) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Graphs inducing totally balanced and submodular Chinese postman games ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ On games arising from multi-depot Chinese postman problems

Cites Work

• Unnamed Item
• On Chinese postman games where residents of each road pay the cost of their road
• On the concavity of delivery games
• Cost allocation in the Chinese postman problem
• Operations research games: A survey. (With comments and rejoinder)
• On the equivalence between some local and global Chinese postman and traveling salesman graphs
• 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

This page was built for publication: On graphs which can or cannot induce Chinese Postman games with a non-empty core