We give a polynomial-time algorithm for online combinatorial auctions with subadditive valuations whose expected social welfare is at least a $1/(6+\varepsilon)$ fraction of the optimal offline wel...
Planning algorithms typically require a symbolic representation of the options to act. Relying on models created manually by experts can be problematic given their availability, knowledge, and asso...
Side-channels—through cache access patterns, timing differences, and speculative execution—can expose confidential information across traditional isolation barriers, thereby putting sensitive data ...
FOMO: using the First-Order translation of Modal Logic as a Lean tactic
TBA
A new version of content is available.
