The following pages link to Knapsack auctions (Q3583425):
Displaying 19 items.
- The Subset Sum game (Q296979) (← links)
- Strategies in competing subset selection (Q367644) (← links)
- Competitive subset selection with two agents (Q643027) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- On core-selecting and core-competitive mechanisms for binary single-parameter auctions (Q777973) (← links)
- On fair price discrimination in multi-unit markets (Q2046039) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Prior-free multi-unit auctions with ordered bidders (Q2210509) (← links)
- Envy freedom and prior-free mechanism design (Q2253834) (← links)
- On social envy-freeness in multi-unit markets (Q2321269) (← links)
- Prompt mechanism for online auctions with multi-unit demands (Q2355988) (← links)
- Ex-post optimal knapsack procurement (Q2402058) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- The power of fair pricing mechanisms (Q2429364) (← links)
- Competitive auctions (Q2506308) (← links)
- Bayesian optimal knapsack procurement (Q2514780) (← links)
- Prompt Mechanism for Online Auctions with Multi-unit Demands (Q2867113) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- Packing Under Convex Quadratic Constraints (Q5041751) (← links)
