Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Uriel Feige"'
Publikováno v:
PLoS Computational Biology, Vol 1, Iss 5, p e50 (2005)
What is the lineage relation among the cells of an organism? The answer is sought by developmental biology, immunology, stem cell research, brain research, and cancer research, yet complete cell lineage trees have been reconstructed only for simple o
Externí odkaz:
https://doaj.org/article/b5b227c25aa64613954235c7957af96a
Autor:
Uriel Feige, Ella Fuchs
Publikováno v:
Journal of Graph Theory. 101:345-378
A path partition (also referred to as a linear forest) of a graph $G$ is a set of vertex-disjoint paths which together contain all the vertices of $G$. An isolated vertex is considered to be a path in this case. The path partition conjecture states t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::592d21900a28aeed87984febf4e40020
https://doi.org/10.1002/jgt.22830
https://doi.org/10.1002/jgt.22830
Publikováno v:
Proceedings of the 23rd ACM Conference on Economics and Computation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3a2ead7ffa1e44717fc2e85fd5a4e5a
https://doi.org/10.1145/3490486.3538285
https://doi.org/10.1145/3490486.3538285
Autor:
Moshe Babaioff, Uriel Feige
We consider fair allocation of a set $M$ of indivisible goods to $n$ equally-entitled agents, with no monetary transfers. Every agent $i$ has a valuation $v_i$ from some given class of valuation functions. A share $s$ is a function that maps a pair $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e381092e36678f47d2482bebb5a155b
http://arxiv.org/abs/2205.07519
http://arxiv.org/abs/2205.07519
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:950-971
Let $G$ be a $2$-coloring of a complete graph on $n$ vertices, for sufficiently large $n$. We prove that $G$ contains at least $n^{(\frac{1}{4} - o(1))\log n}$ monochromatic complete subgraphs of size $r$, where \[ 0.3\log n < r < 0.7\log n. \] The p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7ff0577efa2f6cf07ff3d2bf072e8a2
https://doi.org/10.1137/19m1268859
https://doi.org/10.1137/19m1268859
Publikováno v:
Web and Internet Economics ISBN: 9783031228315
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f307eefb0a64bb063c55146aa5d5160
https://doi.org/10.1007/978-3-031-22832-2_14
https://doi.org/10.1007/978-3-031-22832-2_14
Publikováno v:
ACM Transactions on Algorithms
ACM Transactions on Algorithms, Association for Computing Machinery, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
ACM Transactions on Algorithms, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
ACM Transactions on Algorithms, Association for Computing Machinery, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
ACM Transactions on Algorithms, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
We consider a search problem on trees in which an agent starts at the root of a tree and aims to locate an adversarially placed treasure, by moving along the edges, while relying on local, partial information. Specifically, each node in the tree hold
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9279a813e37baa58751bc4b174c0e743
https://hal.archives-ouvertes.fr/hal-01958133v2/document
https://hal.archives-ouvertes.fr/hal-01958133v2/document
Publikováno v:
ACM Conference on Economics and Computation (EC21)
EC
Proceedings of the 22nd ACM Conference on Economics and Computation
EC
Proceedings of the 22nd ACM Conference on Economics and Computation
The class of gross substitutes (GS) set functions plays a central role in Economics and Computer Science. GS belongs to the hierarchy of complement free valuations introduced by Lehmann, Lehmann and Nisan, along with other prominent classes: GS ⊊ S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::021aedc3909d14a48c9e19b77908e7ff
Publikováno v:
EC
Proceedings of the 22nd ACM Conference on Economics and Computation
ACM Conference on Economics and Computation (EC21)
Proceedings of the 22nd ACM Conference on Economics and Computation
ACM Conference on Economics and Computation (EC21)
We consider the problem of fair allocation of indivisible goods to n agents, with no transfers. When agents have equal entitlements, the well established notion of the maximin share (MMS) serves as an attractive fairness criterion, where to qualify a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::198c1108f1bd551e32d162bcf49a1528