The following pages link to (Q2921720):
Displayed 18 items.
- Truthful optimization using mechanisms with verification (Q391782) (← links)
- Collusive dominant-strategy truthfulness (Q417640) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Strong price of anarchy (Q1007765) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Collusion, efficiency, and dominant strategies (Q2357811) (← links)
- Group strategyproof cost sharing: the role of indifferences (Q2437817) (← links)
- Competitive auctions (Q2506308) (← links)
- Joint misrepresentation with bribes (Q2634138) (← links)
- Collusion-proof mechanisms for multi-unit procurement (Q2685840) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- Deals or No Deals: Contract Design for Online Advertising (Q5031634) (← links)
- (Q5743441) (← links)
- (Q5743445) (← links)
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions (Q5900469) (← links)