Journals about “Secretary
Problems”: Weights and Discounts
First of all, let me to introduce my self. My name is Della Mayangsari and I'm from Indonesia, and now i lived in a city named Wates Kulon Progo. This article is for complete my assignment so I can pass the test next week.
I’m a college student of Secretary program at Yogyakarta State University. So I look for some of journal articles that related about my majority. I found this article journals from SIAM Journals Online and trying to make it more brief. And I'm so proud for being a college student at Yogyakarta State University.
I’m a college student of Secretary program at Yogyakarta State University. So I look for some of journal articles that related about my majority. I found this article journals from SIAM Journals Online and trying to make it more brief. And I'm so proud for being a college student at Yogyakarta State University.
The classical secretary problem studies the problem of selecting online an
element (a “secretary”) with maximum value in a randomly ordered sequence. Constant-competitive
algorithms are known for the classical secretary problems. We study the
following two extensions of the secretary problem:
a. a. In the discounted secretary problem, there is a time-dependent
“discount” factor and
the benefit derived from selecting an element/secretary e at time.
- In the weighted secretary problem, up to K secretaries can be selected; when a secretary is selected (s)he must be irrevocably assigned to one of K positions, with position k having weight, and assigning object/secretary e to position k has benefit.
Most of these results can also be extended to the matroid secretary case (Babaioff ) for a large family of
matroids with a constant-factor loss, and an O(log rank) loss for general matroids. These results are based
on a reduction from various matroids to partition matroids which present a
unified approach to many of the upper bounds of Babaioff et al. These problems
have connections to online mechanism design (Hajiaghayi). All our algorithms
are monotone, and hence lead to truthful mechanisms for the corresponding
online auction problems.
So, from the articles above I can assume that for being an excellent
secretary we must be really be able to do those things while working. And a secretary
is a really good and big jobs. Everyone who wants to be a profesional secretary is a person that have a really good attitude and have a friendly personality.
I think that if we want to service our boss when we're already be a secretary, we have to be so dilligent and obedient at the same time. Boss will be feels comfortable when s/he had a good secretary that can handle all of her/he's schedule. I once met with a girl that worked as a secretary in a company, she really have a good manner and good attitude, smile while meet with anyone and being so friendly. So i attracted to be like her and take this major (Secretary) to be my goals in life.
Thank you for reading this article about Secretary Problems, and I'm sorry if I've made some mistakes, thank you so much. Once again, I hope you all have a really good time and enjoy when reads all of my opinion.
I think that if we want to service our boss when we're already be a secretary, we have to be so dilligent and obedient at the same time. Boss will be feels comfortable when s/he had a good secretary that can handle all of her/he's schedule. I once met with a girl that worked as a secretary in a company, she really have a good manner and good attitude, smile while meet with anyone and being so friendly. So i attracted to be like her and take this major (Secretary) to be my goals in life.
Thank you for reading this article about Secretary Problems, and I'm sorry if I've made some mistakes, thank you so much. Once again, I hope you all have a really good time and enjoy when reads all of my opinion.
Resource : http://epubs.siam.org/doi/abs/10.1137/1.9781611973068.135
http://blogs.uny.ac.id/