2026-09-20T02:20:31Zhttps://wakespace.lib.wfu.edu/server/oai/request

oai:null:10339/822472026-09-02T17:07:32Zcom_10339_14934col_10339_38132

Lidral-Porter, Brendan 2017-06-15T08:36:13Z 2022-06-01T08:30:12Z 2017 https://wakespace.lib.wfu.edu/handle/10339/82247 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. en Wake Forest University Choice function Digraphs Domination Fair choice Hypergraphs Hypertournaments Choice Functions, Digraphs, and Balanced Allocations Thesis Berenhaut, Kenneth S. Mason, Sarah K. Gemmer, John Mathematics and Statistics 2022-06-01 open.access