The Secretary Problem in a Competitive Situation
نویسنده
چکیده
This paper is concerned with two-person non-zero-sum game versions of the secretary problem. A remarkable feature of our models compared with previous ones is that Nash equilibrium strategies are different for two players, i.e. one player should behave more hastily, and the other less hastily, than in the secretary problem.
منابع مشابه
A New Competitive Approach on Multi-Objective Periodic Vehicle Routing Problem
This paper presents a novel multi-objective mathematical model of a periodic vehicle routing problem (PVRP) in a competitive situation for obtaining more sales. In such a situation, the reaching time to customers affects the sale amount therefore, distributors intend to service customers earlier than other rivals for obtaining the maximum sale. Moreover, a partial driver’s benefit is related...
متن کاملA Simple $O(\log\log(\mathrm{rank}))$-Competitive Algorithm for the Matroid Secretary Problem
Only recently progress has been made in obtaining o(log(rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O( √ log(rank))-competitive procedure, and Lachish (2014) later presented a O(log log(rank))competitive algorithm. Both these algorithms and their analyses are very involved, which is also reflected in the extremely h...
متن کاملAdvances on Matroid Secretary Problems: Free Order Model and Laminar Case
The most important open conjecture in the context of the matroid secretary problem claims the existence of an O(1)-competitive algorithm applicable to any matroid. Whereas this conjecture remains open, modified forms of it have been shown to be true, when assuming that the assignment of weights to the secretaries is not adversarial but uniformly at random [23, 20]. However, so far, no variant o...
متن کاملSolving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
The classical secretary problem investigates the question of how to hire the best secretary from n candidates who come in a uniformly random order. In this work we investigate a parallel generalizations of this problem introduced by Feldman and Tennenholtz [14]. We call it shared Q-queue J-choice K-best secretary problem. In this problem, n candidates are evenly distributed into Q queues, and i...
متن کاملA Framework for the Secretary Problem on the Intersection of Matroids
The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximumweight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element has to be taken immediately after its arriv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009