Results 61 to 70 of about 963,583 (273)
Mechanism Design without Money via Stable Matching [PDF]
Mechanism design without money has a rich history in social choice literature. Due to the strong impossibility theorem by Gibbard and Satterthwaite, exploring domains in which there exist dominant strategy mechanisms is one of the central questions in ...
Chen, Ning, Gravin, Nick, Lu, Pinyan
core
Defining Equitable Geographic Districts in Road Networks via Stable Matching
We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling ...
Eppstein, David +3 more
core +1 more source
Time after time – circadian clocks through the lens of oscillator theory
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
Matching Theoretic Beam Selection in Millimeter-Wave Multi-User MIMO Systems
Beamspace multiple-input multiple-output (MIMO) with beam selection offers an attractive solution to reduce the number of radio-frequency chains in a high-dimensional millimeter-wave MIMO system.
Amod Hegde, K. V. Srinivas
doaj +1 more source
Stable Matching Assisted Resource Allocation in Fog Computing Based IoT Networks
Future Internet of Things (IoT) will be a connected network of sensors enabling applications such as industrial automation and autonomous driving. To manage such a large number of applications, efficient computing techniques using fog nodes will be ...
Ahmed S. Alfakeeh, Muhammad Awais Javed
doaj +1 more source
The stable roommates problem with ties [PDF]
We study the variant of the well-known stable roommates problem in which participants are permitted to express ties in their preference lists. In this setting, more than one definition of stability is possible.
David F. Manlove +17 more
core +2 more sources
Farsightedly Stable Matchings [PDF]
We study the properties of von Neumann-Morgenstern farsightedly stable sets in application to matching models. We show that the result by Diamantoudi and Xue (2003) for hedonic games can be extended to a general matching with contracts framework: a collection of singleton stable sets constitutes a weak core of the matching with contracts game.
openaire +1 more source
The newfound relationship between extrachromosomal DNAs and excised signal circles
Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley +1 more source
Driven by the development of platform economy, two-sided matching decision-making (TSDM) has become one of the most important applications in the field of intelligent computation system. Many recommendation systems based on TSDM have facilitated our life.
Junchang Qin +4 more
doaj +1 more source
Online 2-stage stable matching
We focus on an online 2-stage problem, motivated by the following situation: consider a system where students shall be assigned to universities. There is a first round where some students apply, and a first (stable) matching $M_1$ has to be computed. However, some students may decide to leave the system (change their plan, go to a foreign university ...
Bampis, Evripidis +2 more
openaire +5 more sources

