The following pages link to Revenue submodularity (Q2913805):
Displaying 14 items.
- On a modification of the VCG mechanism and its optimality (Q1790209) (← links)
- Matroid rank functions and discrete concavity (Q1926653) (← links)
- Online BP functions maximization (Q2039657) (← links)
- A unifying look at sequence submodularity (Q2238597) (← links)
- Revenue maximization with a single sample (Q2347785) (← links)
- Robust Auctions for Revenue via Enhanced Competition (Q3387955) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208) (← links)
- (Q5091209) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Allocating revenues in a Smart TV ecosystem (Q6088166) (← links)
- Auction timing and market thickness (Q6148583) (← links)