Zobrazeno 1 - 10
of 1 631
pro vyhledávání: '"Vetta, A."'
We study the computational complexity of fairly allocating indivisible, mixed-manna items. For basic measures of fairness, this problem is hard in general. Thus, research has flourished concerning input classes where efficient algorithms exist, both
Externí odkaz:
http://arxiv.org/abs/2409.04225
We introduce a discrete-time immunization version of the SEIS compartment model of infection by a contagious disease, with an extended latency and protective period. The population is modeled by a graph $H$ where vertices represent individuals and ed
Externí odkaz:
http://arxiv.org/abs/2408.05313
Majority Illusion is a phenomenon in social networks wherein the decision by the majority of the network is not the same as one's personal social circle's majority, leading to an incorrect perception of the majority in a large network. In this paper,
Externí odkaz:
http://arxiv.org/abs/2407.20187
A graph $G=(V,E)$ is a $k$-leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and only if they are distance at most $k$ apart in $T$. For $k\le 4$, it is
Externí odkaz:
http://arxiv.org/abs/2407.02412
A preference matrix $M$ has an entry for each pair of candidates in an election whose value $p_{ij}$ represents the proportion of voters that prefer candidate $i$ over candidate $j$. The matrix is rationalizable if it is consistent with a set of vote
Externí odkaz:
http://arxiv.org/abs/2405.20976
We consider the design of a positioning system where a robot determines its position from local observations. This is a well-studied problem of considerable practical importance and mathematical interest. The dominant paradigm derives from the classi
Externí odkaz:
http://arxiv.org/abs/2404.09981
We study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into $k$ connected components (districts) such that its ca
Externí odkaz:
http://arxiv.org/abs/2312.14721
Autor:
Dippel, Jack, Vetta, Adrian
In the famous network creation game of Fabrikant et al. a set of agents play a game to build a connected graph. The $n$ agents form the vertex set $V$ of the graph and each vertex $v\in V$ buys a set $E_v$ of edges inducing a graph $G=(V,\bigcup\limi
Externí odkaz:
http://arxiv.org/abs/2310.08663
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 algorithm for transplant exchange selection may have superior performance in
Externí odkaz:
http://arxiv.org/abs/2309.13421
Publikováno v:
BMC Public Health, Vol 24, Iss 1, Pp 1-11 (2024)
Abstract Background Black individuals in the U.S. face increasing racial disparities in drug overdose related to social determinants of health, including place-based features. Mobile outreach efforts work to mitigate social determinants by servicing
Externí odkaz:
https://doaj.org/article/50bf1242ad4d479aa15ab41496bdb901