{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T09:15:01Z","timestamp":1772442901567,"version":"3.50.1"},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5309,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1994,3]]},"abstract":"<jats:p>There is a close relationship between biased graph games and random graph processes. In this paper, we develop the analogy and give further interesting instances.<\/jats:p>","DOI":"10.1017\/s0963548300000936","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:16:59Z","timestamp":1221218219000},"page":"13-26","source":"Crossref","is-referenced-by-count":20,"title":["Deterministic Graph Games and a Probabilistic Intuition"],"prefix":"10.1017","volume":"3","author":[{"given":"J\u00f3zsef","family":"Beck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300000936_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579230"},{"key":"S0963548300000936_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01897304"},{"key":"S0963548300000936_ref003","first-page":"7","article-title":"Random graphs and positional games on the complete graph","volume":"28","author":"Beck","year":"1985","journal-title":"Annals of Discrete Math."},{"key":"S0963548300000936_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579202"},{"key":"S0963548300000936_ref008","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90005-8"},{"key":"S0963548300000936_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90037-0"},{"key":"S0963548300000936_ref012","first-page":"679","volume-title":"Colloq. Math. Soc. J\u00e1nos Bolyai 37 \u201cFinite and Infinite Sets\u201d Eger","author":"Sz\u00e9kely","year":"1981"},{"key":"S0963548300000936_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70335-2"},{"key":"S0963548300000936_ref010","first-page":"1003","volume-title":"Proc. of the Combinatorial Colloquium in Keszthely","author":"Koml\u00f3s","year":"1973"},{"key":"S0963548300000936_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579267"},{"key":"S0963548300000936_ref005","volume-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"S0963548300000936_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300000936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:08:57Z","timestamp":1557947337000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300000936\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["S0963548300000936"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300000936","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}