-
Learning Product Rankings Robust to Fake Users
In many online platforms, customers' decisions are substantially influen...
09/10/2020 ∙ by Negin Golrezaei, et al. ∙
4
∙
share
read it
-
Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences
The design of personalized incentives or recommendations to improve user...
07/06/2018 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
-
A Capacity-Price Game for Uncertain Renewables Resources
Renewable resources are starting to constitute a growing portion of the ...
04/17/2018 ∙ by Pan Li, et al. ∙
0
∙
share
read it
-
Incentives in the Dark: Multi-armed Bandits for Evolving Users with Unknown Type
Design of incentives or recommendations to users is becoming more common...
03/11/2018 ∙ by Lillian J. Ratliff, et al. ∙
0
∙
share
read it
-
Risk-Averse Matchings over Uncertain Graph Databases
A large number of applications such as querying sensor networks, and ana...
01/09/2018 ∙ by Charalampos E. Tsourakakis, et al. ∙
0
∙
share
read it
-
Uncertainty in Multi-Commodity Routing Networks: When does it help?
We study the equilibrium quality under user uncertainty in a multi-commo...
09/25/2017 ∙ by Shreyas Sekar, et al. ∙
0
∙
share
read it
-
Truthful Mechanisms for Matching and Clustering in an Ordinal World
We study truthful mechanisms for matching and related problems in a part...
10/13/2016 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Blind, Greedy, and Random: Ordinal Approximation Algorithms for Matching and Clustering
We study Matching and other related problems in a partial information se...
12/17/2015 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
-
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing
Consider a setting where selfish agents are to be assigned to coalitions...
08/27/2015 ∙ by Elliot Anshelevich, et al. ∙
0
∙
share
read it
