Pages that link to "Item:Q2516250"
From MaRDI portal
The following pages link to Bayesian incentive compatibility via matchings (Q2516250):
Displaying 17 items.
- Ordinal Bayesian incentive compatibility in restricted domains (Q281414) (← links)
- A Bayesian analysis of the matching problem (Q830693) (← links)
- Bayesian incentive compatible mechanisms (Q1338098) (← links)
- Implementability, Walrasian equilibria, and efficient matchings (Q1672900) (← links)
- Bidder optimal assignments for general utilities (Q1951556) (← links)
- On black-box transformations in downward-closed environments (Q2322707) (← links)
- Reward maximization in general dynamic matching systems (Q2326234) (← links)
- Weak monotonicity and Bayes-Nash incentive compatibility (Q2462292) (← links)
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 (Q2516241) (← links)
- Truthful mechanisms with implicit payment computation (Q2796397) (← links)
- Bayesian algorithmic mechanism design (Q2875156) (← links)
- Computer-Aided Verification for Mechanism Design (Q2959836) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Bernoulli factories and black-box reductions in mechanism design (Q4977969) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- The Complexity of Contracts (Q5856150) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)