The following pages link to Jason D. Hartline (Q536069):
Displayed 41 items.
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Optimal crowdsourcing contests (Q1735735) (← links)
- Characterizing history independent data structures (Q1777279) (← links)
- Item:Q536069 (redirect page) (← links)
- Full surplus extraction from samples (Q2025025) (← links)
- Envy freedom and prior-free mechanism design (Q2253834) (← links)
- Optimal auctions vs. anonymous pricing (Q2278943) (← links)
- Algorithms for data migration (Q2379927) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- (Q2768356) (← links)
- Bayesian algorithmic mechanism design (Q2875156) (← links)
- Multi-parameter mechanism design and sequential posted pricing (Q2875157) (← links)
- (Q2921720) (← links)
- (Q2921789) (← links)
- (Q2921790) (← links)
- (Q3524722) (← links)
- (Q3549687) (← links)
- Competitive generalized auctions (Q3579178) (← links)
- (Q3579478) (← links)
- Knapsack auctions (Q3583425) (← links)
- (Q4411372) (← links)
- (Q4425957) (← links)
- (Q4471297) (← links)
- (Q4785579) (← links)
- (Q4796192) (← links)
- Bernoulli factories and black-box reductions in mechanism design (Q4977969) (← links)
- When Is Pure Bundling Optimal? (Q5049091) (← links)
- Bernoulli Factories and Black-box Reductions in Mechanism Design (Q5056441) (← links)
- Efficient Computation of Optimal Auctions via Reduced Forms (Q5108230) (← links)
- A Truthful Cardinal Mechanism for One-Sided Matching (Q5146917) (← links)
- Inference from Auction Prices (Q5146942) (← links)
- STACS 2004 (Q5309738) (← links)
- (Q5365077) (← links)
- Algorithms and Data Structures (Q5394270) (← links)
- Bayesian Mechanism Design (Q5396759) (← links)
- Prior-independent mechanisms for scheduling (Q5495775) (← links)
- (Q5743442) (← links)
- (Q5743445) (← links)
- Derandomization of auctions (Q5892485) (← links)
- Derandomization of auctions (Q5901102) (← links)
- Revelation gap for pricing from samples (Q6065266) (← links)