{"?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-B9DVANX6/d22e7a0f-4315-4c24-a0be-dd7b17751b56/PDF","dcterms:extent":"467 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-B9DVANX6/88d3c956-8cc7-4d4e-a62b-514642c9cfff/TEXT","dcterms:extent":"55 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-B9DVANX6","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2024","dc:creator":["Bujtás, Csilla","Rote, Günter","Tuza, Zsolt"],"dc:format":[{"@xml:lang":"sl","#text":"19 str."},{"@xml:lang":"sl","#text":"letnik:24"},{"@xml:lang":"sl","#text":"številka:3, article  p3.05"}],"dc:identifier":["DOI:10.26493/1855-3974.2771.4df","ISSN:1855-3966","COBISSID_HOST:202315011","URN:URN:NBN:SI:doc-B9DVANX6"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"en","#text":"fractional domination game"},{"@xml:lang":"en","#text":"fractional transversal game"},{"@xml:lang":"en","#text":"fractional vertex cover"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Optimal strategies in fractional games: vertex cover and domination|"},"dc:description":{"@xml:lang":"sl","#text":"In a hypergraph ?${\\cal H}=(V,{\\cal E})$? with vertex set ?$V$? and edge set ?${\\cal E}$?, a real-valued function ?$f: V \\to 0, 1$? is a fractional transversal if ?$\\sum_{v\\in E} f(v) \\ge 1$? for every edge ?$E \\in {\\cal E}$?. Its size is ?$|f| := \\sum_{v \\in V} f(v)$?, and the fractional transversal number ?$\\tau^\\ast({\\cal H})$? is the smallest possible ?$|f|$?. We consider a game scenario where two players have opposite goals, one of them trying to minimize and the other to maximize the size of a fractional transversal constructed incrementally. We prove that both players have strategies to achieve their common optimum, and they can reach their goals using rational weights"},"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-B9DVANX6","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-B9DVANX6"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-B9DVANX6/d22e7a0f-4315-4c24-a0be-dd7b17751b56/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.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":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-B9DVANX6/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-B9DVANX6"}}}}