The following pages link to (Q5417648):
Displaying 21 items.
- A note on the incompatibility of strategy-proofness and Pareto-optimality in quasi-linear settings with public budgets (Q433728) (← links)
- Multi-unit auctions with budget limits (Q765207) (← links)
- A near Pareto optimal auction with budget constraints (Q765229) (← links)
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support (Q1043359) (← links)
- A simple mechanism for a budget-constrained buyer (Q2190384) (← links)
- Clinching auctions with online supply (Q2206820) (← links)
- Selling mechanisms for a financially constrained buyer (Q2212767) (← links)
- Truthful unit-demand auctions with budgets revisited (Q2257295) (← links)
- Towards characterizing the deterministic combinatorial constrained efficient space (Q2290365) (← links)
- Mechanisms for combinatorial auctions with budget constraints (Q2318114) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Polyhedral clinching auctions and the AdWords polytope (Q2796405) (← links)
- Dictatorial mechanisms in constrained combinatorial auctions (Q2867515) (← links)
- Budget-constrained auctions with heterogeneous items (Q2913820) (← links)
- Multi-unit Auctions with Budgets and Non-uniform Valuations (Q4909583) (← links)
- Polyhedral Clinching Auctions for Two-Sided Markets (Q5076699) (← links)
- Multiplicative Pacing Equilibria in Auction Markets (Q5080654) (← links)
- Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case (Q5283446) (← links)
- Online random sampling for budgeted settings (Q5919606) (← links)
- Walrasian pricing in multi-unit auctions (Q6136100) (← links)
- Polyhedral clinching auctions for indivisible goods (Q6609155) (← links)
