The following pages link to Competitive auctions (Q2506308):
Displayed 42 items.
- Maxmin mechanism in a simple common value auction (Q397961) (← links)
- Better redistribution with inefficient allocation in multi-unit auctions (Q460636) (← links)
- Controlling the state of a motorway using express lanes (Q499122) (← links)
- Pricing commodities (Q627117) (← links)
- Tractable stochastic analysis in high dimensions via robust optimization (Q715242) (← links)
- Multi-unit auctions with budget limits (Q765207) (← links)
- Worst-case optimal redistribution of VCG payments in multi-unit auctions (Q834856) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
- The generalized random priority mechanism with budgets (Q1622384) (← links)
- Auctions for social lending: a theoretical analysis (Q2016244) (← links)
- Full surplus extraction from samples (Q2025025) (← links)
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
- Optimal digital product auctions with unlimited supply and rebidding behavior (Q2070733) (← links)
- Asymptotically optimal prior-free clock auctions (Q2173111) (← links)
- Prior-free multi-unit auctions with ordered bidders (Q2210509) (← links)
- Mechanism design with possibilistic beliefs (Q2253833) (← links)
- Envy freedom and prior-free mechanism design (Q2253834) (← links)
- Revenue maximization with a single sample (Q2347785) (← links)
- Analyses of cardinal auctions (Q2350901) (← links)
- The power of fair pricing mechanisms (Q2429364) (← links)
- Robust game theory (Q2492691) (← links)
- Optimal VCG mechanisms to assign multiple bads (Q2516237) (← links)
- Characterization of Truthful Mechanisms for One-Dimensional Single Facility Location Game with Payments (Q2937768) (← links)
- Computer-Aided Verification for Mechanism Design (Q2959836) (← links)
- Robust Auctions for Revenue via Enhanced Competition (Q3387955) (← links)
- Optimal Impartial Selection (Q3449559) (← links)
- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures (Q3599064) (← links)
- Making the Most of Your Samples (Q4641589) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- Truthful Generalized Assignments via Stable Matching (Q5244865) (← links)
- Optimal Design for Multi-Item Auctions: A Robust Optimization Approach (Q5247609) (← links)
- Hats, auctions and derandomization (Q5252259) (← links)
- Prompt Mechanisms for Online Auctions (Q5459982) (← links)
- Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
- Derandomization of auctions (Q5892485) (← links)
- Online random sampling for budgeted settings (Q5919606) (← links)
- Strength in numbers: robust mechanisms for public goods with many agents (Q6062957) (← links)
- Budget-balanced and strategy-proof auctions for ridesharing (Q6109306) (← links)