Recent theories of democratic representation push beyond ‘minimalist’ notions that only rely on periodic elections to connect officials and constituents. For example, Jane Mansbridge (2019) calls for ‘recursive representation’, which seeks ongoing, two-way interaction between representatives and their constituents. Given the scale and complexity of modern representative democracies, how can such ambitious proposals be translated into practice? We analyze two Deliberative Town Halls (DTHs) convened with a Federal Member of Australian Parliament in 2020 to discuss a complex issue, mitochondrial donation, ahead of a parliamentary debate and conscience vote on this issue. Drawing on interviews with participants, we argue that democratic innovations such as DTHs can contribute to realizing recursive representation when three criteria are met: authenticity, inclusion, and impact. We discuss the significance of each criterion and the role of DTHs in advancing recursive representation in a parliamentary system.

Queueing systems with non-exponential service distributions and a capacity restriction on the total residual service requirement (workload) are studied. Closed-form expressions of geometric form in the LCFS case and recursive representations in the FCFS case are obtained for the steady state workload distribution. The proof is of interest in itself and directly leads to extensions.

This paper is about representations for equilibrium sojourn time distributions in Jackson networks of queues. For a network with N single-server nodes let hi be the Laplace transform of the residual system sojourn time for a customer ‘arriving' to node i, ‘arrival' meaning external input or internal transfer. The transforms {hi : i = 1, ···, N} are shown to satisfy a system of equations we call the network flow equations. These equations lead to a general recursive representation for the higher moments of the sojourn time variables {Ti : i = 1, ···, N}. This recursion is discussed and then, by way of illustration, applied to the single-server Markovian queue with feedback.