Online combinatorial assignment in independence systems
From MaRDI portal
Cites work
- A constant factor prophet inequality for online combinatorial auctions
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders
- Combinatorial optimization. Theory and algorithms.
- Combinatorial Walrasian equilibrium
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Comparisons of stop rule and supremum expectations of i.i.d. random variables
- Computing Walrasian equilibria: fast algorithms and structural properties
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- scientific article; zbMATH DE number 7788378 (Why is no real title available?)
- Matroid Intersection
- Matroid intersection algorithms
- Matroid matching and some applications
- Matroid prophet inequalities and applications to multi-dimensional mechanism design
- Matroid Secretary Problems
- On (random-order) online contention resolution schemes for the matching polytope of (bipartite) graphs
- Online contention resolution schemes with applications to Bayesian selection problems
- Optimal item pricing in online combinatorial auctions
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Prophet secretary for combinatorial auctions and matroids
- Random order contention resolution schemes
- Reducibility among combinatorial problems
- Stop rule and supremum expectations of i.i.d. random variables: A complete comparison by conjugate duality
- Strong algorithms for the ordinal matroid secretary problem
- Understanding preferences: ``demand types, and the existence of equilibrium with indivisibilities
This page was built for publication: Online combinatorial assignment in independence systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030553)
