A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed...

Automated bilateral negotiation forms an important type of interaction in agent based systems for electronic commerce; it allows seller and customer to determine the terms and content of the trade iteratively and bilaterally. Consequently, deals may be highly customized (especially for complex...

We consider bargaining in a bipartite network of buyers and sellers, who can only trade with the limited number of people with whom they are connected. Such networks could arise due to proximity issues or restricted communication flows, as with information transmission of job openings, business...

Purpose – A literature review revealed that in recent times, many companies have attempted organization‐wide change management through the philosophy and principles of Lean Thinking (LT). Although some organizations have transformed and reaped significant benefits in this endeavour, many...

The ability to accurately estimate the extent to which the failure of a bank disrupts the financial system is very valuable for regulators of the financial system. One important part of the financial system is the interbank payment system. This paper develops a robust measure, SinkRank, that...

In the maximum dispersion problem, a given set of objects has to be partitioned into a number of groups. Each object has a non-negative weight and each group has a target weight, which may be different for each group. In addition to meeting the target weight of each group, all objects assigned...

Centrality measures play an important role in the field of network analysis. In the particular case of social networks, the flow represents the way in which information passes through the network nodes. Freeman et al. (1991) were the first authors to relate centrality measures to network flow...

We consider the optimal ship navigation problem wherein the goal is to find the shortest path between two given coordinates in the presence of obstacles subject to safety distance and turn-radius constraints. These obstacles can be debris, rock formations, small islands, ice blocks, other ships,...