Search Results for author:
Found 4 papers, 0 papers with code
Approximating Pandora's Box with Correlations
For distributions of support $m$, UDT admits a $\log m$ approximation, and while a constant factor approximation in polynomial time is a long-standing open problem, constant factor approximations are achievable in subexponential time (arXiv:1906. 11385).
Individual Fairness in Advertising Auctions through Inverse Proportionality
This value stability constraint is expressed as a function that maps the multiplicative distance between value vectors to the maximum allowable $\ell_{\infty}$ distance between the corresponding allocations.
Multi-Category Fairness in Sponsored Search Auctions
Fairness in advertising is a topic of particular concern motivated by theoretical and empirical observations in both the computer science and economics literature.
Truth and Regret in Online Scheduling
The service provider's goal is to implement a truthful online mechanism for scheduling jobs so as to maximize the social welfare of the schedule.
