Pages that link to "Item:Q391782"
From MaRDI portal
The following pages link to Truthful optimization using mechanisms with verification (Q391782):
Displaying 15 items.
- Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems (Q543619) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- General truthfulness characterizations via convex analysis (Q2667284) (← links)
- (Q3455573) (← links)
- Mechanisms with Monitoring for Truthful RAM Allocation (Q3460805) (← links)
- Reducing truth-telling online mechanisms to online optimization (Q3581276) (← links)
- Obviously Strategyproof Mechanisms for Machine Scheduling. (Q5075789) (← links)
- Truthful and Near-Optimal Mechanism Design via Linear Programming (Q5395669) (← links)
- Characterizing Truthful Multi-armed Bandit Mechanisms (Q5419036) (← links)
- Automata, Languages and Programming (Q5466459) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
- Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives (Q6100445) (← links)