The following pages link to (Q5365073):
Displaying 19 items.
- An online sequential procurement mechanism under uncertain demands in multi-cloud environment (Q1726280) (← links)
- Auction mechanisms for allocating subsidies for carbon emissions reduction: an experimental investigation (Q2058861) (← links)
- Mechanisms for dual-role-facility location games: truthfulness and approximability (Q2172605) (← links)
- A simple mechanism for a budget-constrained buyer (Q2190384) (← links)
- Simple and efficient budget feasible mechanisms for monotone submodular valuations (Q2190400) (← links)
- Hardness of and approximate mechanism design for the bike rebalancing problem (Q2283013) (← links)
- Selling privacy at auction (Q2347786) (← links)
- Ex-post optimal knapsack procurement (Q2402058) (← links)
- Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design (Q2959848) (← links)
- Budget Feasible Procurement Auctions (Q4971366) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- Tight Revenue Gaps among Multiunit Mechanisms (Q5048292) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- Budget feasible mechanisms on matroids (Q5925520) (← links)
- Budget-feasible mechanisms for proportionally selecting agents from groups (Q6080647) (← links)
- Budget-feasible Sybil-proof mechanisms for crowdsensing (Q6168078) (← links)
- Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents (Q6609125) (← links)
- Auction design for value maximizers with budget and return-on-spend constraints (Q6609167) (← links)
