Related papers: Core-Stable Kidney Exchange via Altruistic Donors
Indirect reciprocity is a foundational mechanism of human cooperation. Existing models of indirect reciprocity fail to robustly support social cooperation: image scoring models fail to provide robust incentives, while social standing models…
Donors in silicon can now be positioned with an accuracy of about one lattice constant, making it possible in principle to form donor arrays for quantum computation or quantum simulation applications. However the multi-valley character of…
The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic $k$-set packing, where the problem is to find a maximum packing…
The core is a traditional and useful solution concept in economic theory. But in discrete exchange economies without transfers, when endowments are complex, the core may be empty. This motivates Balbuzanov and Kotowski (2019) to interpret…
The allocation of scarce donor organs constitutes one of the most consequential algorithmic challenges in healthcare. While the field is rapidly transitioning from rigid, rule-based systems to machine learning and data-driven optimization,…
Cross-chain swaps enable exchange of different assets that reside on different blockchains. Several protocols have been proposed for atomic cross-chain swaps. However, those protocols are not fault-tolerant, in the sense that if any party…
A key question in cooperative game theory is that of coalitional stability, usually captured by the notion of the \emph{core}--the set of outcomes such that no subgroup of players has an incentive to deviate. However, some coalitional games…
Consider a set of clients in a broadcast network, each of which holds a subset of packets in the ground set X. In the (coded) cooperative data exchange problem, the clients need to recover all packets in X by exchanging coded packets over a…
Datastores today rely on distribution and replication to achieve improved performance and fault-tolerance. But correctness of many applications depends on strong consistency properties - something that can impose substantial overheads,…
Explaining the evolution of cooperation in the strong altruism scenario, where a cooperator does not benefit from her contribution to the public goods, is a challenging problem that requires positive assortment among cooperators (i.e.,…
We study a two-sided matching model where one side of the market (hospitals) has combinatorial preferences over the other side (doctors). Specifically, we consider the setting where hospitals have matroid rank valuations over the doctors,…
Despite efforts to increase the supply of organs from living donors, most kidney transplants performed in Australia still come from deceased donors. The age of these donated organs has increased substantially in recent decades as the rate…
In a multiple partners matching problem the agents can have multiple partners up to their capacities. In this paper we consider both the two-sided many-to-many stable matching problem and the one-sided stable fixtures problem under…
Matching algorithms are used routinely to match donors to recipients for solid organs transplantation, for the assignment of medical residents to hospitals, record linkage in databases, scheduling jobs on machines, network switching, online…
This paper is concerned with a model in econophysics, the subfield of statistical physics that applies concepts from traditional physics to economics. In our model, economical agents are represented by the vertices of a connected graph and…
A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of vertices in k-core to improve the stability of a network. In…
We investigate a market without money in which agents can offer certain goods (or multiple copies of an agent-specific good) in exchange for goods of other agents. The exchange must be balanced in the sense that each agent should receive a…
In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that…
We study data exchange among strategic agents without monetary transfers, motivated by domains such as research consortia and healthcare collaborations where payments are infeasible or restricted. The central challenge is to reap the…
Atomic swaps have been widely considered to be an ideal solution for cross-chain cryptocurrency transactions due to their trustless and decentralized nature. However, their adoption in practice has been strictly limited compared to…