Pages that link to "Item:Q2796405"
From MaRDI portal
The following pages link to Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405):
Displaying 18 items.
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions (Q903629) (← links)
- On a modification of the VCG mechanism and its optimality (Q1790209) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- A simple mechanism for a budget-constrained buyer (Q2190384) (← links)
- Clinching auctions with online supply (Q2206820) (← links)
- Mechanisms for combinatorial auctions with budget constraints (Q2318114) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← links)
- Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets (Q2959831) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- Budget-Management Strategies in Repeated Auctions (Q5003721) (← links)
- Polyhedral Clinching Auctions for Two-Sided Markets (Q5076699) (← links)
- Multiplicative Pacing Equilibria in Auction Markets (Q5080654) (← links)
- Expressiveness and Robustness of First-Price Position Auctions (Q5219714) (← links)
- (Q5415469) (redirect page) (← links)
- Budget feasible mechanisms on matroids (Q5925520) (← links)
