In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided search mechanisms are based on a purely sequential search of all searchers, our mechanism integrates an ability of some of the agents to maintain several search efforts in parallel at each search stage. We show that i...

———————————————————————————————Abstract In sciences and industries such as signal optimization, traffic assignment, economic market and etc, many problems have been modeled by bilevel programming (BLP) problems, where in each level one must optimize some objective functions. There are so many algorithms in order to find the global optimum of the linear version of BLP problems. This paper addres...

As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against an adversary with multistructures. Precisely, there are m functions f1, ..., fm and m adversary structures A1, ...,Am, where fi is required to be securely computed against an Ai-adversary. We give a general construction to build...

A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three notions of capacity—the one-shot capacity, the zero-error capacity, and the compound zero-error capacity—are obtained for point-to-point channels, and generalized to corresponding capa...

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...