The following pages link to The Dynamic Pivot Mechanism (Q3564698):
Displaying 50 items.
- Efficient dynamic mechanisms with interdependent valuations (Q290174) (← links)
- Efficient investment in a dynamic auction environment (Q417675) (← links)
- Efficiency levels in sequential auctions with dynamic arrivals (Q480844) (← links)
- Dynamic mechanism design with interdependent valuations (Q497945) (← links)
- Taking turns (Q523521) (← links)
- Real-time pricing for LQG power networks with independent types: a dynamic mechanism design approach (Q681150) (← links)
- Auctions with dynamic populations: efficiency and revenue maximization (Q694743) (← links)
- Robust dynamic implementation (Q893413) (← links)
- Collusion enforcement with private information and private monitoring (Q894017) (← links)
- On budget balance of the dynamic pivot mechanism (Q894630) (← links)
- Optimal dynamic mechanism design with deadlines (Q899681) (← links)
- Introduction to symposium on dynamic contracts and mechanism design (Q900598) (← links)
- Optimal stopping with private information (Q900599) (← links)
- Dynamic revenue maximization: a continuous time approach (Q900603) (← links)
- Dynamic contracting under permanent and transitory private information (Q1677245) (← links)
- Optimal periodic flexible policies for two-stage serial supply chains (Q1754309) (← links)
- Calendar mechanisms (Q2013347) (← links)
- Online incentive-compatible mechanisms for traffic intersection auctions (Q2030521) (← links)
- Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
- Optimal market thickness (Q2123167) (← links)
- On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment (Q2150676) (← links)
- Simple pricing schemes for consumers with evolving values (Q2155905) (← links)
- On the complexity of dynamic mechanism design (Q2155909) (← links)
- Dynamic search models with multiple items (Q2173124) (← links)
- A Markovian Stackelberg game approach for computing an optimal dynamic mechanism (Q2245712) (← links)
- Online ascending auctions for gradually expiring items (Q2253832) (← links)
- An efficient dynamic allocation mechanism for security in networks of interdependent strategic agents (Q2292109) (← links)
- Auctions with online supply (Q2343399) (← links)
- Mechanism design with information acquisition (Q2358793) (← links)
- Efficient allocations in economies with asymmetric information when the realized frequency of types is common knowledge (Q2363423) (← links)
- One-step-ahead implementation (Q2425196) (← links)
- The dynamic Vickrey auction (Q2437814) (← links)
- Markovian assignment rules (Q2452135) (← links)
- Dynamic slot allocations with different patience levels (Q2667272) (← links)
- Ready to trade? On budget-balanced efficient trade with uncertain arrival (Q2685832) (← links)
- Epsilon-efficiency in a dynamic partnership with adverse selection and moral hazard (Q2690369) (← links)
- Equilibria in Online Games (Q2796211) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- Bayesian Incentive-Compatible Bandit Exploration (Q3387959) (← links)
- From Monetary to Nonmonetary Mechanism Design via Artificial Currencies (Q4958545) (← links)
- (Q4993317) (← links)
- Tractable Equilibria in Sponsored Search with Endogenous Budgets (Q4994152) (← links)
- Incentive-Compatible Learning of Reserve Prices for Repeated Auctions (Q4994171) (← links)
- Spatio-Temporal Pricing for Ridesharing Platforms (Q5080659) (← links)
- Bayesian Exploration: Incentivizing Exploration in Bayesian Games (Q5080666) (← links)
- Dynamic Double Auctions: Toward First Best (Q5106370) (← links)
- Long-Term Partnership for Achieving Efficient Capacity Allocation (Q5129174) (← links)
- Multiagent Mechanism Design Without Money (Q5129203) (← links)
- Robust Dynamic Pricing with Strategic Customers (Q5219692) (← links)
- Prior‐free dynamic allocation under limited liability (Q6059545) (← links)
