platform's recommendation algorithm. We study how such platforms should account for this external traffic in the design of … special case of online matching, where (using VolunteerMatch terminology) volunteers arrive sequentially and probabilistically …'s online algorithm selects which opportunity to recommend. In evaluating the performance of different algorithms, we refine the …

important consideration, without which a match can be ineffective. Online matching platforms are a useful resource in such … credentials. In this paper, we examine an online matching platform's decisions about whether to offer positioning and … addressed by these services, we show that the choices online matching platforms face about offering them are non-trivial. We …

We investigate an online edge-weighted bipartite matching problem with general capacity constraints. In this problem … the offline linear program. We analyze the performance guarantee of each algorithm in terms of its competitive ratio … offline solution to guide the online algorithm decisions. We find that the algorithm’s competitive ratio can be significantly …

, whilst others do not? To answer this question, we operationalise ‘field theory’ using social network analysis (SNA). SNA … measures the properties of nodes, ties, and clusters statistically whilst field theory suggests that people act in certain ways … because of shared values. We draw some elements from Actor-Network Theory (ANT), such as the incorporation of non-human actors …