On the concavity of delivery games

Research output: Book/ReportReportProfessional

54 Downloads (Pure)

Abstract

Delivery games, introduced by Hamers, Borm, van de Leensel and Tijs (1994), are combinatorial optimization games that arise from delivery problems closely related to the Chinese postman problem (CPP). They showed that delivery games are not necessarily balanced. For delivery problems corresponding to the class of bridge-connected Euler graphs they showed that the related games are balanced. This paper focuses on the concavity property for delivery games. A delivery game arising from a delivery model corresponding to a bridge-connected Euler graph needs not to be concave. The main result will be that for delivery problems corresponding to the class of bridge-connected cyclic graphs, which is a subclass of the class of bridge-connected Euler graphs, the related delivery games are concave.
Original languageEnglish
PublisherUnknown Publisher
Number of pages20
Volume9529
Publication statusPublished - 1995

Publication series

NameDiscussion Papers / CentER for Economic Research
Volume9529

Fingerprint

Concavity
Game
Euler
Graph in graph theory
Chinese Postman Problem
Combinatorial Optimization
Class

Cite this

Hamers, H. J. M. (1995). On the concavity of delivery games. (Discussion Papers / CentER for Economic Research; Vol. 9529). Unknown Publisher.
Hamers, H.J.M. / On the concavity of delivery games. Unknown Publisher, 1995. 20 p. (Discussion Papers / CentER for Economic Research).
@book{f1a3830b913247699a3c33d26e260214,
title = "On the concavity of delivery games",
abstract = "Delivery games, introduced by Hamers, Borm, van de Leensel and Tijs (1994), are combinatorial optimization games that arise from delivery problems closely related to the Chinese postman problem (CPP). They showed that delivery games are not necessarily balanced. For delivery problems corresponding to the class of bridge-connected Euler graphs they showed that the related games are balanced. This paper focuses on the concavity property for delivery games. A delivery game arising from a delivery model corresponding to a bridge-connected Euler graph needs not to be concave. The main result will be that for delivery problems corresponding to the class of bridge-connected cyclic graphs, which is a subclass of the class of bridge-connected Euler graphs, the related delivery games are concave.",
author = "H.J.M. Hamers",
note = "Pagination: 20",
year = "1995",
language = "English",
volume = "9529",
series = "Discussion Papers / CentER for Economic Research",
publisher = "Unknown Publisher",

}

Hamers, HJM 1995, On the concavity of delivery games. Discussion Papers / CentER for Economic Research, vol. 9529, vol. 9529, Unknown Publisher.

On the concavity of delivery games. / Hamers, H.J.M.

Unknown Publisher, 1995. 20 p. (Discussion Papers / CentER for Economic Research; Vol. 9529).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - On the concavity of delivery games

AU - Hamers, H.J.M.

N1 - Pagination: 20

PY - 1995

Y1 - 1995

N2 - Delivery games, introduced by Hamers, Borm, van de Leensel and Tijs (1994), are combinatorial optimization games that arise from delivery problems closely related to the Chinese postman problem (CPP). They showed that delivery games are not necessarily balanced. For delivery problems corresponding to the class of bridge-connected Euler graphs they showed that the related games are balanced. This paper focuses on the concavity property for delivery games. A delivery game arising from a delivery model corresponding to a bridge-connected Euler graph needs not to be concave. The main result will be that for delivery problems corresponding to the class of bridge-connected cyclic graphs, which is a subclass of the class of bridge-connected Euler graphs, the related delivery games are concave.

AB - Delivery games, introduced by Hamers, Borm, van de Leensel and Tijs (1994), are combinatorial optimization games that arise from delivery problems closely related to the Chinese postman problem (CPP). They showed that delivery games are not necessarily balanced. For delivery problems corresponding to the class of bridge-connected Euler graphs they showed that the related games are balanced. This paper focuses on the concavity property for delivery games. A delivery game arising from a delivery model corresponding to a bridge-connected Euler graph needs not to be concave. The main result will be that for delivery problems corresponding to the class of bridge-connected cyclic graphs, which is a subclass of the class of bridge-connected Euler graphs, the related delivery games are concave.

M3 - Report

VL - 9529

T3 - Discussion Papers / CentER for Economic Research

BT - On the concavity of delivery games

PB - Unknown Publisher

ER -

Hamers HJM. On the concavity of delivery games. Unknown Publisher, 1995. 20 p. (Discussion Papers / CentER for Economic Research).