On the public citation graph

Submodularity, pairwise independence and correlation gap

https://doi.org/10.2139/ssrn.4677310
0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01753431openalex-extracted
Cores of convex games
inferredcites →https://doi.org/10.1007/s12532-016-0104-zopenalex-extracted
Computing convex hulls and counting integer points with polymake
inferredcites →https://doi.org/10.1016/0012-365x(74)90127-7openalex-extracted
Extreme convex set functions with finite carrier: General theory
inferredcites →https://doi.org/10.1016/s0304-3975(99)00196-6openalex-extracted
Extremality of submodular functions
inferredcites →https://doi.org/10.1038/nature04701openalex-extracted
Weak pairwise correlations imply strongly correlated network states in a neural population
inferredcites →https://doi.org/10.1063/1.533200openalex-extracted
Towards a theory of negative dependence
inferredcites →https://doi.org/10.1090/s0894-0347-08-00618-8openalex-extracted
Negative dependence and the geometry of polynomials
inferredcites →https://doi.org/10.1137/080733991openalex-extracted
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
inferredcites →https://doi.org/10.1137/1.9781611973082.56openalex-extracted
Mechanism Design via Correlation Gap
inferredcites →https://doi.org/10.1137/1.9781611974782.110openalex-extracted
Combinatorial Prophet Inequalities
inferredcites →https://doi.org/10.1137/110839655openalex-extracted
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
inferredcites →https://doi.org/10.1137/18m1226130openalex-extracted
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems
inferredcites →https://doi.org/10.1137/21m1408294openalex-extracted
Tight Probability Bounds with Pairwise Independence
inferredcites →https://doi.org/10.1137/s0895480192228140openalex-extracted
Constructing Small Sample Spaces Satisfying Given Constraints
inferredcites →https://doi.org/10.1137/s1052623403430610openalex-extracted
Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
inferredcites →https://doi.org/10.1145/1806689.1806733openalex-extracted
Multi-parameter mechanism design and sequential posted pricing
inferredcites →https://doi.org/10.1145/1807406.1807428openalex-extracted
Multi-parameter mechanism design and sequential posted pricing
inferredcites →https://doi.org/10.1145/195058.195420openalex-extracted
The amazing power of pairwise independence (abstract)
inferredcites →https://doi.org/10.1145/1993636.1993740openalex-extracted
Submodular function maximization via the multilinear relaxation and contention resolution schemes
inferredcites →https://doi.org/10.1201/9780367803896openalex-extracted
Multivariate Models and Multivariate Dependence Concepts
inferredcites →https://doi.org/10.1214/aoms/1177704732openalex-extracted
Pairwise Independence of Jointly Dependent Variables
inferredcites →https://doi.org/10.1287/mnsc.2013.1881openalex-extracted
Appointment Scheduling with Limited Distributional Information
inferredcites →https://doi.org/10.1287/opre.1110.1011openalex-extracted
Price of Correlations in Stochastic Optimization
inferredcites →https://doi.org/10.1287/opre.2021.2243openalex-extracted
Distributionally Robust Linear and Discrete Optimization with Marginals
inferredcites →https://doi.org/10.1515/9781400822539openalex-extracted
Supermodularity and Complementarity
inferredcites →https://doi.org/10.1561/0400000009openalex-extracted
Pairwise Independence and Derandomization
inferredcites →https://doi.org/10.1561/2200000039openalex-extracted
Learning with Submodular Functions: A Convex Optimization Perspective
inferredcites →https://doi.org/10.1561/9781601987570openalex-extracted
Learning with Submodular Functions: A Convex Optimization Perspective
inferredcites →https://doi.org/10.2139/ssrn.2317332openalex-extracted
inferredcites →https://doi.org/10.2139/ssrn.3159473openalex-extracted
Distributionally Robust Linear and Discrete Optimization with Marginals
inferredcites →https://doi.org/10.2307/3213097openalex-extracted
Convex majorization with an application to the length of critical paths
inferredcites →https://doi.org/10.48550/arxiv.1711.01566openalex-extracted
Stochastic Submodular Maximization: The Case of Coverage Functions
inferredcites →https://doi.org/10.48550/arxiv.1802.05249openalex-extracted
Distributionally Robust Submodular Maximization
inferredcites →https://doi.org/10.48550/arxiv.2107.03662openalex-extracted
inferredcites →https://doi.org/10.1016/j.tcs.2024.114814openalex-snapshot
On submodular prophet inequalities and correlation gap
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.