skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, April 12 until 2:00 AM ET on Saturday, April 13 due to maintenance. We apologize for the inconvenience.


Title: On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
Award ID(s):
1703925
NSF-PAR ID:
10350149
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
SIAM Journal on Computing
Volume:
51
Issue:
3
ISSN:
0097-5397
Page Range / eLocation ID:
492 to 548
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found