The following pages link to S. Matthew Weinberg (Q776252):
Displayed 37 items.
- Persuasion and incentives through the lens of duality (Q776253) (← links)
- Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
- On symmetries in multi-dimensional mechanism design (Q2152104) (← links)
- Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
- Optimal item pricing in online combinatorial auctions (Q2164686) (← links)
- Pricing lotteries (Q2253836) (← links)
- Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
- Reaching Consensus via non-Bayesian Asynchronous Learning in Social Networks (Q2969618) (← links)
- Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions (Q4575682) (← links)
- (Q4608024) (← links)
- (Q4608040) (← links)
- Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
- (Q4993305) (← links)
- A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
- A Duality-Based Unified Approach to Bayesian Mechanism Design (Q4997317) (← links)
- The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization (Q5056403) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- (Q5090375) (← links)
- A Simple and Approximately Optimal Mechanism for an Additive Buyer (Q5133980) (← links)
- Separating the communication complexity of truthful and non-truthful combinatorial auctions (Q5144993) (← links)
- Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items (Q5212809) (← links)
- Parallel algorithms for select and partition with noisy comparisons (Q5361885) (← links)
- A duality based unified approach to Bayesian mechanism design (Q5361891) (← links)
- Bayesian Truthful <i>Mechanisms</i> for Job Scheduling from Bi-criterion Approximation <i>Algorithms</i> (Q5363020) (← links)
- Prophet Inequalities with Limited Information (Q5384062) (← links)
- Matroid prophet inequalities (Q5415470) (← links)
- An algorithmic characterization of multi-dimensional mechanisms (Q5415495) (← links)
- (Q5417650) (← links)
- Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations (Q5741750) (← links)
- Optimal and Efficient Parametric Auctions (Q5741751) (← links)
- (Q5875695) (← links)
- (Q5875764) (← links)
- Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard (Q5875767) (← links)
- New Query Lower Bounds for Submodular Function Minimization (Q5875771) (← links)
- Exponential communication separations between notions of selfishness (Q6065222) (← links)
- (Q6126303) (← links)
- Tight bounds on 3-team manipulations in randomized death match (Q6167255) (← links)