Pages that link to "Item:Q3586184"
From MaRDI portal
The following pages link to On the Computational Power of Demand Queries (Q3586184):
Displayed 15 items.
- Optimization with uniform size queries (Q527424) (← links)
- Informational limitations of ascending combinatorial auctions (Q972880) (← links)
- On the robustness of non-linear personalized price combinatorial auctions (Q976430) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Ascending prices and package bidding: further experimental analysis (Q2442851) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Combinatorial Walrasian Equilibrium (Q3460334) (← links)
- Mechanisms with Monitoring for Truthful RAM Allocation (Q3460805) (← links)
- Iterative Auction Design for Tree Valuations (Q3465578) (← links)
- (Q5743455) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)