{"id":{"repo_id":"wfu","oai_identifier":"oai:wakespace.lib.wfu.edu:10339/82247"},"canonical_url":"https://search.dev.ndltd.org/etd/wfu/oai:wakespace.lib.wfu.edu:10339/82247","repository":{"repo_id":"wfu","name":"Wake Forest University","base_url":"https://wakespace.lib.wfu.edu/oai/request"},"display":{"title":"Choice Functions, Digraphs, and Balanced Allocations","abstract":"In this thesis, we consider broadly the concept of choice in a variety of settings, focusing on equity in selection. In particular, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges, and are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs are presented. In addition, we consider fairness for choice functions, from a sequential perspective, prove existence of fair choice, and consider connections with balanced allocation, path-connected directed graphs and cyclic preference. Several open questions are posed.","abstract_html":"In this thesis, we consider broadly the concept of choice in a variety of settings, focusing on equity in selection. In particular, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges, and are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs are presented. In addition, we consider fairness for choice functions, from a sequential perspective, prove existence of fair choice, and consider connections with balanced allocation, path-connected directed graphs and cyclic preference. Several open questions are posed.","abstract_has_math":false,"creators":["Lidral-Porter, Brendan"],"institution":"Wake Forest University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-27T22:02:11Z","subjects":["Choice function"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10339/82247","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Lidral-Porter, Brendan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-06-15T08:36:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-06-01T08:30:12Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:publisher","label":"Institution","values":["Wake Forest University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Choice function"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10339/82247"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we consider broadly the concept of choice in a variety of settings, focusing on equity in selection. In particular, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges, and are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs are presented. In addition, we consider fairness for choice functions, from a sequential perspective, prove existence of fair choice, and consider connections with balanced allocation, path-connected directed graphs and cyclic preference. Several open questions are posed."]},{"key":"dc:title","label":"Title","values":["Choice Functions, Digraphs, and Balanced Allocations"]}]}],"canonical_facts":{"dc:creator":["Lidral-Porter, Brendan"],"dc:date.accessioned":["2017-06-15T08:36:13Z"],"dc:date.available":["2022-06-01T08:30:12Z"],"dc:date.issued":["2017"],"dc:description.abstract":["In this thesis, we consider broadly the concept of choice in a variety of settings, focusing on equity in selection. In particular, we introduce the concept of (pair-wise) domination graphs for hypergraphs endowed with a choice function on edges, and are interested, for instance, in minimal numbers of edges for associated domination graphs. Theorems regarding the existence of balanced (zero-edge) domination graphs are presented. In addition, we consider fairness for choice functions, from a sequential perspective, prove existence of fair choice, and consider connections with balanced allocation, path-connected directed graphs and cyclic preference. Several open questions are posed."],"dc:identifier.uri":["http://hdl.handle.net/10339/82247"],"dc:language.iso":["en"],"dc:publisher":["Wake Forest University"],"dc:subject":["Choice function"],"dc:title":["Choice Functions, Digraphs, and Balanced Allocations"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T22:02:11Z"}