Pages that link to "Item:Q2016253"
From MaRDI portal
The following pages link to Optimal collusion-resistant mechanisms with verification (Q2016253):
Displaying 17 items.
- Heterogeneous facility location without money (Q290519) (← links)
- Collusive dominant-strategy truthfulness (Q417640) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- Automated optimal OSP mechanisms for set systems. The case of small domains (Q777956) (← links)
- On the feasibility of maximal collusion (Q1178824) (← links)
- Average-case approximation ratio of scheduling without payments (Q2032343) (← links)
- Mechanism design with costly verification and limited punishments (Q2295836) (← links)
- Collusion, efficiency, and dominant strategies (Q2357811) (← links)
- The anarchy of scheduling without money (Q2420568) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- Collusion-resistant mechanisms for single-parameter agents (Q2921720) (← links)
- Mechanisms with Monitoring for Truthful RAM Allocation (Q3460805) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
- On scheduling mechanisms beyond the worst case (Q6670812) (← links)