Pages that link to "Item:Q3546342"
From MaRDI portal
The following pages link to AdWords and generalized online matching (Q3546342):
Displayed 38 items.
- How to allocate goods in an online market? (Q262246) (← links)
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions (Q373243) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Frequency capping in online advertising (Q490332) (← links)
- Prediction and welfare in ad auctions (Q506530) (← links)
- Stochastic models for budget optimization in search-based advertising (Q603917) (← links)
- Advertisement allocation for generalized second-pricing schemes (Q614045) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Mediators in position auctions (Q834851) (← links)
- Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching (Q897954) (← links)
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions (Q903629) (← links)
- Repeated budgeted second price ad auction (Q1678769) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- Online Collaborative Filtering on Graphs (Q2830757) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- Model Predictive Control for Dynamic Resource Allocation (Q2925344) (← links)
- Online Stochastic Matching: Online Actions Based on Offline Statistics (Q2925346) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Online Ad Assignment with an Ad Exchange (Q3453291) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
- Minimum Cost Perfect Matching with Delays for Two Sources (Q5283368) (← links)
- A Truthful Mechanism for Offline Ad Slot Scheduling (Q5459983) (← links)