{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:7741"},"canonical_url":"https://search.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:7741","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Waiter–Client and Client–Waiter games","abstract":"In this thesis, we consider two types of positional games; \\(Waiter\\)-\\(Client\\) and \\(Client\\)-\\(Waiter\\) games. Each round in a biased (\\(a\\):\\(b\\)) game begins with Waiter offering a+b free elements of the board to Client. Client claims \\(a\\) elements among these and the remaining \\(b\\) elements are claimed by Waiter. Waiter wins in a Waiter-Client game if he can force Client to fully claim a \\(winning\\) \\(set\\), otherwise Client wins. In a Client-Waiter game, Client wins if he can claim a winning set himself, else Waiter wins. We estimate the \\(threshold\\) \\(bias\\) of four different (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter games. This is the unique value of Waiter's bias \\(q\\) at which the player with a winning strategy changes. We find its asymptotic value for both versions of the complete-minor and non-planarity games and give bounds for both versions of the non-\\(r\\)-colourability and \\(k\\)-SAT games. Our results show that these games exhibit a heuristic called the \\(probabilistic\\) \\(intuition\\). We also find sharp probability thresholds for the appearance of a graph in the random graph \\(G\\)(\\(n\\),\\(p\\)) on which Waiter and Client win the (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter Hamiltonicity games respectively.","abstract_html":"In this thesis, we consider two types of positional games; \\(Waiter\\)-\\(Client\\) and \\(Client\\)-\\(Waiter\\) games. Each round in a biased (\\(a\\):\\(b\\)) game begins with Waiter offering a+b free elements of the board to Client. Client claims \\(a\\) elements among these and the remaining \\(b\\) elements are claimed by Waiter. Waiter wins in a Waiter-Client game if he can force Client to fully claim a \\(winning\\) \\(set\\), otherwise Client wins. In a Client-Waiter game, Client wins if he can claim a winning set himself, else Waiter wins. We estimate the \\(threshold\\) \\(bias\\) of four different (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter games. This is the unique value of Waiter&#x27;s bias \\(q\\) at which the player with a winning strategy changes. We find its asymptotic value for both versions of the complete-minor and non-planarity games and give bounds for both versions of the non-\\(r\\)-colourability and \\(k\\)-SAT games. Our results show that these games exhibit a heuristic called the \\(probabilistic\\) \\(intuition\\). We also find sharp probability thresholds for the appearance of a graph in the random graph \\(G\\)(\\(n\\),\\(p\\)) on which Waiter and Client win the (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter Hamiltonicity games respectively.","abstract_has_math":true,"creators":["Tan, Wei En"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-12","date_published":"2017-12","updated_at":"2026-11-19T09:29:38Z","subjects":["QA Mathematics"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"http://etheses.bham.ac.uk//id/eprint/7741/1/Tan17PhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://etheses.bham.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Aetheses.bham.ac.uk%3A7741","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["na"]},{"key":"dc:creator","label":"Author","values":["Tan, Wei En"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017-12"]},{"key":"dc:date.issued","label":"Date","values":["2017-12"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Mathematics"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/7741/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.dcterms_iso639_2","label":"Language (ISO 639-2)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/7741/1/Tan17PhD.pdf","http://etheses.bham.ac.uk//id/eprint/7741/2/Decl_IS_Tan17PhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we consider two types of positional games; \\(Waiter\\)-\\(Client\\) and \\(Client\\)-\\(Waiter\\) games. Each round in a biased (\\(a\\):\\(b\\)) game begins with Waiter offering a+b free elements of the board to Client. Client claims \\(a\\) elements among these and the remaining \\(b\\) elements are claimed by Waiter. Waiter wins in a Waiter-Client game if he can force Client to fully claim a \\(winning\\) \\(set\\), otherwise Client wins. In a Client-Waiter game, Client wins if he can claim a winning set himself, else Waiter wins. We estimate the \\(threshold\\) \\(bias\\) of four different (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter games. This is the unique value of Waiter's bias \\(q\\) at which the player with a winning strategy changes. We find its asymptotic value for both versions of the complete-minor and non-planarity games and give bounds for both versions of the non-\\(r\\)-colourability and \\(k\\)-SAT games. Our results show that these games exhibit a heuristic called the \\(probabilistic\\) \\(intuition\\). We also find sharp probability thresholds for the appearance of a graph in the random graph \\(G\\)(\\(n\\),\\(p\\)) on which Waiter and Client win the (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter Hamiltonicity games respectively."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public","staffonly"]},{"key":"dc:title","label":"Title","values":["Waiter–Client and Client–Waiter games"]}]}],"canonical_facts":{"dc:contributor.sponsor":["na"],"dc:creator":["Tan, Wei En"],"dc:date":["2017-12"],"dc:date.issued":["2017-12"],"dc:description.abstract":["In this thesis, we consider two types of positional games; \\(Waiter\\)-\\(Client\\) and \\(Client\\)-\\(Waiter\\) games. Each round in a biased (\\(a\\):\\(b\\)) game begins with Waiter offering a+b free elements of the board to Client. Client claims \\(a\\) elements among these and the remaining \\(b\\) elements are claimed by Waiter. Waiter wins in a Waiter-Client game if he can force Client to fully claim a \\(winning\\) \\(set\\), otherwise Client wins. In a Client-Waiter game, Client wins if he can claim a winning set himself, else Waiter wins. We estimate the \\(threshold\\) \\(bias\\) of four different (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter games. This is the unique value of Waiter's bias \\(q\\) at which the player with a winning strategy changes. We find its asymptotic value for both versions of the complete-minor and non-planarity games and give bounds for both versions of the non-\\(r\\)-colourability and \\(k\\)-SAT games. Our results show that these games exhibit a heuristic called the \\(probabilistic\\) \\(intuition\\). We also find sharp probability thresholds for the appearance of a graph in the random graph \\(G\\)(\\(n\\),\\(p\\)) on which Waiter and Client win the (\\(1\\):\\(q\\)) Waiter-Client and Client-Waiter Hamiltonicity games respectively."],"dc:format":["application/pdf"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/7741/1/Tan17PhD.pdf","http://etheses.bham.ac.uk//id/eprint/7741/2/Decl_IS_Tan17PhD.pdf"],"dc:language.dcterms_iso639_2":["eng"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Mathematics"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/7741/"],"dc:subject":["QA Mathematics"],"dcterms:accessrights":["public","staffonly"],"dc:title":["Waiter–Client and Client–Waiter games"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-11-19T09:29:38Z"}