P
Peter Borm
Researcher at Tilburg University
Publications - 354
Citations - 4906
Peter Borm is an academic researcher from Tilburg University. The author has contributed to research in topics: Game theory & Shapley value. The author has an hindex of 36, co-authored 353 publications receiving 4605 citations. Previous affiliations of Peter Borm include University of Santiago de Compostela & Universidad Miguel Hernández de Elche.
Papers
More filters
Journal ArticleDOI
On the position value for communication situations
TL;DR: An axiomatic characterization of the position value is provided and relations with the Myerson value are discussed, and, for special classes of communication situations, elegant calculation methods for their position values are described.
Journal ArticleDOI
Operations Research Games: a Survey
TL;DR: This paper surveys the research area of cooperative games associated with several types of operations research problems in which various decision makers (players) are involved on the basis of a distinction between the nature of the underlying optimisation problem: connection, routing, scheduling, production and inventory.
Posted Content
Cooperative games with stochastic payoffs
TL;DR: In this paper, a new class of cooperative games arising from cooperative decision-making problems in a stochastic environment is introduced, and a variant of Farkas' lemma is used to prove that the core of a game within this class is not empty if and only if the game is balanced.
Journal ArticleDOI
Cooperative games with stochastic payoffs
TL;DR: A variant of Farkas' lemma is used to prove that the core of a game within this class of cooperative games is non-empty if and only if the game is balanced.
Journal ArticleDOI
The influence of secrecy on the communication structure of covert networks
TL;DR: In this article, the authors analyze the tradeoff between secrecy and operational efficiency in a set of connected graphs of given order as possible communication structures and show that the optimal communication structure corresponds to either a network with a central individual (the star graph) or an all-to-all network (the complete graph) depending on the link detection probability.