Presents an algorithm-to-contract framework that lifts FPTASes to approximately incentive-compatible contracts for budgeted combinatorial problems without demand oracles, applying to matroids, matchings, and multi-agent non-additive rewards.
Reducibility among combinatorial problems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The paper finds the threshold probability for random subgraphs of Dirac graphs to admit Hamilton cycle transversals and derives optimal counting and packing corollaries that generalize single-graph Hamilton cycle results.
citing papers explorer
-
An Algorithm-to-Contract Framework without Demand Queries
Presents an algorithm-to-contract framework that lifts FPTASes to approximately incentive-compatible contracts for budgeted combinatorial problems without demand oracles, applying to matroids, matchings, and multi-agent non-additive rewards.
-
Robust Hamiltonicity in families of Dirac graphs
The paper finds the threshold probability for random subgraphs of Dirac graphs to admit Hamilton cycle transversals and derives optimal counting and packing corollaries that generalize single-graph Hamilton cycle results.