1 citations · 2 across the 7 of their papers we have counts for
8 papers
Learning in Proportional Allocation Auctions Games
Younes Ben Mazziane, Cleque-Marlain Mboulou Moutoubi, Eitan Altman +1
The Kelly or proportional allocation mechanism is a simple and efficient auction-based scheme that distributes an infinitely divisible resource proportionally to the agents bids. W…
Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
Younes Ben Mazziane, Vinay Kumar B. R., Othmane Marfoq
Elastic-Sketch is a hash-based data structure for counting item's appearances in a data stream, and it has been empirically shown to achieve a better memory-accuracy trade-off comp…
Efficient and Optimal No-Regret Caching under Partial Observation
Younes Ben Mazziane, Francescomaria Faticanti, Sara Alouf +1
Online learning algorithms have been successfully used to design caching policies with sublinear regret in the total number of requests, with no statistical assumption about the re…
Count-Min Sketch with Conservative Updates: Worst-Case Analysis
Younes Ben Mazziane, Othmane Marfoq
Count-Min Sketch with Conservative Updates (CMS-CU) is a memory-efficient hash-based data structure used to estimate the occurrences of items within a data stream. CMS-CU stores $m…
Performance Model for Similarity Caching
Younes Ben Mazziane, Sara Alouf, Giovanni Neglia +1
Similarity caching allows requests for an item to be served by a similar item. Applications include recommendation systems, multimedia retrieval, and machine learning. Recently, ma…
No-Regret Caching with Noisy Request Estimates
Younes Ben Mazziane, Francescomaria Faticanti, Giovanni Neglia +1
Online learning algorithms have been successfully used to design caching policies with regret guarantees. Existing algorithms assume that the cache knows the exact request sequence…