Abstract: This paper introduces a new class of interactive cooperative purchasing situations and provides an explicit alternative characterization of the nucleolus of cooperative games, which offers an alternative to Kohlberg (1971). In our cooperative purchasing situation, the unit price of a...

This article investigates the structural position of covert (terrorist or criminal) networks. Using the secrecy versus information tradeoff characterization of covert networks it is shown that their network structures are generally not small-worlds, in contradistinction to many overt social...

In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a...

A highway problem is determined by a connected graph which provides all potential entry and exit vertices and all possible edges that can be constructed between vertices, a cost function on the edges of the graph and a set of players, each in need of constructing a connection between a specific...

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations.In max-RP sequencing situations it is assumed that each player's cost...

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine.The costs of an agent depend linearly on the final completion time of his jobs.We describe a procedure that provides an optimal...

This paper considers situations characterized by a common-pool resource, which needs to be divided among agents. Each of the agents has some claim on this pool and an individual reward function for assigned resources. This paper analyzes not only the problem of max- imizing the total joint...

This paper focuses on sharing the costs and revenues of maintaining a public network communication structure.Revenues are assumed to be bilateral and communication links are publicly available but costly.It is assumed that agents are located at the vertices of an undirected graph in which the...

This paper is a reaction on Ginsburgh and Zang (2003).It reconsiders the problem where a group of museums offer a pass such that the owner can visit these museums an unlimited number of times during a fixed period of time.The problem addressed is how to share the total joint income of this pass...

Subject classifications: Terrorism; Counterinsurgency; Intelligence; Defense; Covert networks; Affiliation networks.