On analyzing cost allocation problems

Cooperation building structures and order problem representations

John Kleppe, Peter Borm, Ruud Hendrickx, Hans Reijnierse

Research output: Contribution to journalArticleScientificpeer-review

Abstract

To analyze cost allocation problems, this paper identifies associated cooperation building structures, with joint cost functions, and corresponding efficient order problem representations, with individualized cost functions. This paper presents an approach that, when applicable, offers a way not only to adequately model a cost allocation problem by means of a cooperative cost game, but also to construct a core element of such a game by means of a generalized Bird allocation. We apply the approach to both existing and new classes of cost allocation problems related to operational research problems: sequencing situations without initial ordering, maintenance problems, minimum cost spanning tree situations, permutation situations without initial allocation, public congestion network situations, traveling salesman problems, shared taxi problems and traveling repairman problems.
Original languageEnglish
Article number1850007
JournalInternational Game Theory Review
Volume20
DOIs
Publication statusPublished - 2018

Fingerprint

Cost Allocation
Costs
Cost functions
Traveling salesman problem
Cost Function
Birds
Game
Allocation problem
Cost allocation
Problem representation
Operations Research
Travelling salesman problems
Spanning tree
Congestion
Sequencing
Permutation
Maintenance
Cost function

Keywords

  • cost allocation problem
  • cooperation building structure
  • order problem representation
  • transferable utility game
  • generalized Bird allocation

Cite this

@article{005f2d79956943d09d14433359617de5,
title = "On analyzing cost allocation problems: Cooperation building structures and order problem representations",
abstract = "To analyze cost allocation problems, this paper identifies associated cooperation building structures, with joint cost functions, and corresponding efficient order problem representations, with individualized cost functions. This paper presents an approach that, when applicable, offers a way not only to adequately model a cost allocation problem by means of a cooperative cost game, but also to construct a core element of such a game by means of a generalized Bird allocation. We apply the approach to both existing and new classes of cost allocation problems related to operational research problems: sequencing situations without initial ordering, maintenance problems, minimum cost spanning tree situations, permutation situations without initial allocation, public congestion network situations, traveling salesman problems, shared taxi problems and traveling repairman problems.",
keywords = "cost allocation problem, cooperation building structure, order problem representation, transferable utility game, generalized Bird allocation",
author = "John Kleppe and Peter Borm and Ruud Hendrickx and Hans Reijnierse",
year = "2018",
doi = "10.1142/S021919891850007X",
language = "English",
volume = "20",
journal = "International Game Theory Review",
issn = "0219-1989",
publisher = "World Scientific Publishing Co. Pte Ltd",

}

On analyzing cost allocation problems : Cooperation building structures and order problem representations. / Kleppe, John; Borm, Peter; Hendrickx, Ruud; Reijnierse, Hans.

In: International Game Theory Review, Vol. 20, 1850007, 2018.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - On analyzing cost allocation problems

T2 - Cooperation building structures and order problem representations

AU - Kleppe, John

AU - Borm, Peter

AU - Hendrickx, Ruud

AU - Reijnierse, Hans

PY - 2018

Y1 - 2018

N2 - To analyze cost allocation problems, this paper identifies associated cooperation building structures, with joint cost functions, and corresponding efficient order problem representations, with individualized cost functions. This paper presents an approach that, when applicable, offers a way not only to adequately model a cost allocation problem by means of a cooperative cost game, but also to construct a core element of such a game by means of a generalized Bird allocation. We apply the approach to both existing and new classes of cost allocation problems related to operational research problems: sequencing situations without initial ordering, maintenance problems, minimum cost spanning tree situations, permutation situations without initial allocation, public congestion network situations, traveling salesman problems, shared taxi problems and traveling repairman problems.

AB - To analyze cost allocation problems, this paper identifies associated cooperation building structures, with joint cost functions, and corresponding efficient order problem representations, with individualized cost functions. This paper presents an approach that, when applicable, offers a way not only to adequately model a cost allocation problem by means of a cooperative cost game, but also to construct a core element of such a game by means of a generalized Bird allocation. We apply the approach to both existing and new classes of cost allocation problems related to operational research problems: sequencing situations without initial ordering, maintenance problems, minimum cost spanning tree situations, permutation situations without initial allocation, public congestion network situations, traveling salesman problems, shared taxi problems and traveling repairman problems.

KW - cost allocation problem

KW - cooperation building structure

KW - order problem representation

KW - transferable utility game

KW - generalized Bird allocation

U2 - 10.1142/S021919891850007X

DO - 10.1142/S021919891850007X

M3 - Article

VL - 20

JO - International Game Theory Review

JF - International Game Theory Review

SN - 0219-1989

M1 - 1850007

ER -