Results 171 to 180 of about 22,632 (241)

Stochastically evolving graphs via edit semigroups. [PDF]

Proc Natl Acad Sci U S A
Chung F, Robertson SJ.
europepmc   +1 more source

Strategyproof and fair matching mechanism for union of symmetric m-convex constraints. [PDF]

PLoS One
Barrot N, Yahiro K, Yokoo M, Zhang Y.
europepmc   +1 more source

Knot theory and error-correcting codes. [PDF]

Des Codes Cryptogr
Kılıç AB, Nijsten A, Pellikaan R, Ravagnani A.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Matroid Secretary is Equivalent to Contention Resolution

Information Technology Convergence and Services, 2021
We show that the matroid secretary problem is equivalent to correlated contention resolution in the online random-order model. Specifically, the matroid secretary conjecture is true if and only if every matroid admits an online random-order contention ...
S. Dughmi
semanticscholar   +1 more source

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

SIAM Journal on Computing, 2011
Chandra Chekuri, Martin Pál
exaly   +2 more sources

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations

Adaptive Agents and Multi-Agent Systems, 2020
We study fair and economically efficient allocation of indivisible goods among agents whose valuations are rank functions of matroids. Such valuations constitute a well-studied class of submodular functions (i.e., they exhibit a diminishing returns ...
Siddharth Barman, Paritosh Verma
semanticscholar   +1 more source