{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-4PNRHXPV/d38716bc-9334-4d91-a341-8a6cd189aca8/PDF","dcterms:extent":"313 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-4PNRHXPV/98ad8cf5-dd1f-4ede-9079-475ae15e1675/TEXT","dcterms:extent":"17 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2026","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2026"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-4PNRHXPV","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-FNN1A9OB"},{"@xml:lang":"sl","#text":"Obzornik za matematiko in fiziko"}],"dcterms:issued":"2017","dc:creator":"Vidmar, Matija","dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:64"},{"@xml:lang":"sl","#text":"str. 1-9"}],"dc:identifier":["ISSN:0473-7466","COBISSID:18050905","URN:URN:NBN:SI:doc-4PNRHXPV"],"dc:language":"sl","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"sl","#text":"matematika"},{"@xml:lang":"sl","#text":"problemi"}],"dcterms:temporal":{"@rdf:resource":"2008-2026"},"dc:title":{"@xml:lang":"sl","#text":"Problem izbire najboljše tajnice|"},"dc:description":[{"@xml:lang":"sl","#text":"In the secretary problem we consecutively interview, for a single open position, ?$n \\in \\mathbb{N}_{\\ge 2}$? applicants, with the goal of choosing the best. The decision of whether to reject or accept a given applicant must be made immediately following his interview. For large ?$n$?, approximately, it is optimal to decline the first ?$n/$e? candidates and then to hire the first one that is better than all his predecessors; the best being thus chosen with probability ?$1/e$?. The problem admits a precise and explicit solution for arbitrary ?$n$?"},{"@xml:lang":"sl","#text":"V problemu izbire najboljše tajnice zaporedoma intervjuvamo za eno samo odprto delovno mesto ?$n \\in \\mathbb{N}_{\\ge 2}$? kandidatov s ciljem, da izberemo najboljšega med njimi. O zavrnitvi ali sprejemu kandidata se moramo odločiti takoj po njegovem intervjuju. Za velike ?$n$? je, v približku, optimalno zavrniti prvih ?$n/e$? kandidatov in nato vzeti prvega, ki je boljši od vseh prejšnjih; najboljšega tako izberemo z verjetnostjo ?$1/e$?. Problem ima natančno in eksplicitno rešitev za vse ?$n$?"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-4PNRHXPV","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-4PNRHXPV"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-4PNRHXPV/d38716bc-9334-4d91-a341-8a6cd189aca8/PDF"},"edm:rights":{"@rdf:resource":"http://rightsstatements.org/vocab/InC/1.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-4PNRHXPV/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-4PNRHXPV"}}}}