We modify W. Vickrey's (1961, J. Finance 16, 8 37) mechanism for call markets by introducing the participation stage and study the efficiency properties of the modified mechanism. We provide sufficient conditions under which the modified Vickrey double auction achieves full efficiency. In addition, we prove that the modified Vickrey double auction achieves asymptotic efficiency even when full e...

Collections of journal papers, often referred to as ’citation networks’, can be modeled as a collection of coupled bipartite networks which tend to exhibit linear growth and preferential attachment as papers are added to the collection. Assuming primary nodes in the first partition and secondary nodes in the second partition, the basic bipartite Yule process assumes that as each primary node is...

Understanding the structure and dynamics of the user behavior networks for web traffic (To be convenient in next sections, we refer to replace it as UBNWT) that connect users with servers across the Internet is a key to modeling the network and designing future application. The Web-visited bipartite networks, called the user behavioral networks, display a natural bipartite structure: two kinds ...

In this paper, we present a collaborative filtering algorithm based on the bipartite network projection. First, we project the bipartite network to a weighted directed one-mode network in order to retain original information and extract hidden information. The weight of an edge denotes how important the ending vertex is to the starting one. Then, we implement the algorithm using projection netw...

Maňuch and Stacho [7] introduced the problem of designing f -tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur in the network. In this paper, we provide f -tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc-forwarding index and the optical index. These co...

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...