economic cooperation organization (eco) is one of the institutions that have been established to help identify and resolve the problems faced by the region. in order to celebrate the eco day, a meeting was held at the center for graduate international studies, faculty of law and political science, university of tehran as attended by yahya maroufi, eco secretary-general, mr. taherian, eco under-...

1 Faculty of Medicine, Universiti Sultan Zainal Abidin (UniSZA), Medical Campus, Jalan Sultan Mahmud, 20400 Kuala Terengganu, Terengganu, Malaysia 2 Faculty of Health Sciences, UniSZA, Gong Badak Campus, 21300, Kuala Terengganu, Terengganu, Malaysia. 3 Department of Medical Microbiology and Parasitology, School of Medical Sciences, Universiti Sains Malaysia, Health Campus, 16150, Kubang Kerian,...

Consider a scenario in which there are multiple employers competing to hire the best possible employee. How does the competition between the employers affect their hiring strategies or their ability to hire one of the best possible candidates? In this paper, we address this question by studying a generalization of the classical secretary problem from optimal stopping theory: a set of ranked emp...

The classical secretary problem is a well known optimal stopping problem from probability theory. It is usually described by different real life examples, notably the process of hiring a secretary. Imagine a company manager in need of a secretary. Our manager wants to hire only the best secretary from a given set of n candidates, where n is known. No candidate is equally as qualified as another...

The Secretary problem is studied with minimal cognitive agents, being a problem that needs memory and judgment. A sequence of values, drawn from an unknown range, is presented; the agent has only one chance to pick a single value as they are presented, and should try to maximize the value chosen. In extension of previous work (Tuci et al. 2002), Continuous Time Recurrent Neural Networks (CTRNN)...

In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the al...