Kidney exchange programs (KEPs) typically seek to match incompatible patient-donor pairs
based on a utilitarian objective where the number or overall quality of transplants is …

In Kidney Exchange Programs (KEPs), each participating patient is registered together with
an incompatible donor. Donors without an incompatible patient can also register. Then …

Problem definition: Kidney paired donation programs allow patients registered with an
incompatible donor to receive a suitable kidney from another donor, as long as the latter's co …

We study the probabilistic assignment of items to platforms that satisfies both group and
individual fairness constraints. Each item belongs to specific groups and has a preference …

Generative Flow Networks, known as GFlowNets, have been introduced in recent times,
presenting an exciting possibility for neural networks to model distributions across various …

One cannot make truly fair decisions using integer linear programs unless one controls the
selection probabilities of the (possibly many) optimal solutions. For this purpose, we propose …

In barter exchanges agents enter seeking to swap their items for other items on their wishlist.
We consider a centralized barter exchange with a set of agents and items where each item …

A kidney exchange program, also called a kidney paired donation program, can be viewed
as a repeated, dynamic trading and allocation mechanism. This suggests that a dynamic …

Kidney exchange programs (KEPs) increase kidney transplantation by facilitating the
exchange of incompatible donors. Increasing the scale of KEPs leads to more opportunities …

We consider fair resource allocation in sequential decision-making environments modeled
as weakly coupled Markov decision processes, where resource constraints couple the …