Pages that link to "Item:Q5167758"
From MaRDI portal
The following pages link to Efficiency Guarantees in Auctions with Budgets (Q5167758):
Displaying 22 items.
- An efficient multi-item dynamic auction with budget constrained bidders (Q495767) (← links)
- Welfare guarantees for proportional allocations (Q506519) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Efficient money burning in general domains (Q506525) (← links)
- Liquid welfare maximization in auctions with multiple items (Q681843) (← links)
- Autobidding with constraints (Q776226) (← links)
- Efficiency of lowest-unmatched price auctions (Q1668178) (← links)
- A note on the efficiency of position mechanisms with budget constraints (Q1711420) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Polyhedral clinching auctions and the AdWords polytope (Q2796405) (← links)
- Position Auctions with Budgets: Existence and Uniqueness (Q3161816) (← links)
- Approximately Efficient Double Auctions with Strong Budget Balance (Q4575681) (← links)
- The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users (Q5000644) (← links)
- Polyhedral Clinching Auctions for Two-Sided Markets (Q5076699) (← links)
- Walrasian pricing in multi-unit auctions (Q5111298) (← links)
- Online random sampling for budgeted settings (Q5919606) (← links)
- Walrasian pricing in multi-unit auctions (Q6136100) (← links)
- Maximize liquid welfare in combinatorial auctions with monotone valuations (Q6542876) (← links)
- Polyhedral clinching auctions for indivisible goods (Q6609155) (← links)
- Auction design for value maximizers with budget and return-on-spend constraints (Q6609167) (← links)
