The following pages link to Mechanism design in large games (Q2988894):
Displaying 7 items.
- Logarithmic query complexity for approximate Nash computation in large games (Q1733380) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443) (← links)
- Private Matchings and Allocations (Q2832895) (← links)
- Privacy and Truthful Equilibrium Selection for Aggregative Games (Q3460796) (← links)
- Segmentation, Incentives, and Privacy (Q5219697) (← links)
- Coopetition Against an Amazon (Q6135971) (← links)
