Pages that link to "Item:Q3527217"
From MaRDI portal
The following pages link to Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue (Q3527217):
Displaying 38 items.
- How to allocate goods in an online market? (Q262246) (← links)
- A dynamic learning algorithm for online matching problems with concave returns (Q319996) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Frequency capping in online advertising (Q490332) (← links)
- Advertisement allocation for generalized second-pricing schemes (Q614045) (← links)
- Autobidding with constraints (Q776226) (← links)
- Competitive online algorithms for resource allocation over the positive semidefinite cone (Q1650777) (← links)
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- Online algorithms for maximum cardinality matching with edge arrivals (Q1741843) (← links)
- New online algorithms for story scheduling in web advertising (Q1755774) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Clinching auctions with online supply (Q2206820) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Second-price ad auctions with binary bids and markets with good competition (Q2453168) (← links)
- Decentralized online integer programming problems with a coupling cardinality constraint (Q2669516) (← links)
- Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
- Stochastization of Weighted Automata (Q2946327) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- Tractable Equilibria in Sponsored Search with Endogenous Budgets (Q4994152) (← links)
- (Q5002758) (← links)
- Budget-Management Strategies in Repeated Auctions (Q5003721) (← links)
- Fair Resource Allocation in a Volatile Marketplace (Q5031013) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Prophet Matching with General Arrivals (Q5085120) (← links)
- Online Resource Allocation with Personalized Learning (Q5106359) (← links)
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals (Q5111708) (← links)
- Interior-Point-Based Online Stochastic Bin Packing (Q5144776) (← links)
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios (Q5144796) (← links)
- Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
- (Q5743510) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Online ad allocation in bounded-degree graphs (Q6112021) (← links)