Abdellah Aznag

Generating author description...

All published works

Action	Title	Year	Authors
+	MNL-Bandit with Knapsacks	2021	Abdellah Aznag Vineet Goyal Noémie Périvier
+	MNL-Bandit with Knapsacks	2021	Abdellah Aznag Vineet Goyal Noémie Périvier
+	The tropicalization of the entropic barrier	2020	Xavier Allamigeon Abdellah Aznag Stéphane Gaubert Yassine Hamdi

Common Coauthors

Coauthor	Papers Together
Vineet Goyal	2
Noémie Périvier	2
Yassine Hamdi	1
Stéphane Gaubert	1
Xavier Allamigeon	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits	2014	Branislav Kveton Zheng Wen Azin Ashkan Csaba Szepesvári	1
+ PDF Chat	The real field with convergent generalized power series	1998	Lou van den Dries Patrick Speissegger	1
+	Interior-Point Polynomial Algorithms in Convex Programming	1994	Yurii Nesterov Arkadi Nemirovski	1
+	Feature Article—The Ellipsoid Method: A Survey	1981	Robert G. Bland Donald Goldfarb Michael J. Todd	1
+	Mathematical problems for the next century	1998	Steve Smale	1
+ PDF Chat	Near optimal online algorithms and fast approximation algorithms for resource allocation problems	2011	Nikhil R. Devanur Kamal Jain Balasubramanian Sivan Christopher A. Wilkens	1
+	Path Finding Methods for Linear Programming: Solving Linear Programs in &#x00D5;(vrank) Iterations and Faster Algorithms for Maximum Flow	2014	Yin Tat Lee Aaron Sidford	1
+ PDF Chat	Bandits with Knapsacks	2013	Ashwinkumar Badanidiyuru Robert Kleinberg Aleksandrs Slivkins	1
+ PDF Chat	Dynamic pricing with limited supply	2012	Moshe Babaioff Shaddin Dughmi Robert Kleinberg Aleksandrs Slivkins	1
+	Online Resource Allocation with Customer Choice	2015	Guillermo Gallego Anran Li Van‐Anh Truong Xinshang Wang	1
+	A Mathematical View of Interior-Point Methods in Convex Optimization	2001	James Renegar	1
+ PDF Chat	Tropicalizing the Simplex Algorithm	2015	Xavier Allamigeon Pascal Benchimol Stéphane Gaubert Michael Joswig	1
+	Assortment Optimization under Unknown MultiNomial Logit Choice Models.	2017	Wang Chi Cheung David Simchi‐Levi	1
+	Thompson Sampling for the MNL-Bandit	2017	Shipra Agrawal Vashist Avadhanula Vineet Goyal Assaf Zeevi	1
+ PDF Chat	Log-Barrier Interior Point Methods Are Not Strongly Polynomial	2018	Xavier Allamigeon Pascal Benchimol Stéphane Gaubert Michael Joswig	1
+	Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models	2018	Yining Wang Xi Chen Yuan Zhou	1
+	Universal Barrier is $n$-Self-Concordant	2018	Yin Tat Lee Man–Chung Yue	1
+	Inventory Balancing with Online Learning	2018	Wang Chi Cheung Will Ma David Simchi‐Levi Xinshang Wang	1
+ PDF Chat	Knapsack Based Optimal Policies for Budget–Limited Multi–Armed Bandits	2021	The Anh Han Archie C. Chapman Alex Rogers Nicholas R. Jennings	1
+	Multi-Armed Bandits in Metric Spaces	2008	Robert Kleinberg Aleksandrs Slivkins Eli Upfal	1
+	A Dynamic Near-Optimal Algorithm for Online Linear Programming	2009	Shipra Agrawal Zizhuo Wang Yinyu Ye	1
+	Thompson Sampling for Budgeted Multi-armed Bandits	2015	Yingce Xia Haifang Li Tao Qin Nenghai Yu Tie‐Yan Liu	1
+ PDF Chat	Tail bounds for sums of geometric and exponential variables	2017	Svante Janson	1
+	Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints.	2019	Elaheh Fata Will Ma David Simchi‐Levi	1
+ PDF Chat	MNL-Bandit: A Dynamic Learning Approach to Assortment Selection	2019	Shipra Agrawal Vashist Avadhanula Vineet Goyal Assaf Zeevi	1
+	Solving Linear Programs with Sqrt(rank) Linear System Solves	2019	Yin Tat Lee Aaron Sidford	1
+	Dual Mirror Descent for Online Allocation Problems	2020	Haihao Lu Santiago Balseiro Vahab Mirrokni	1
+ PDF Chat	Tropical Ehrhart theory and tropical volume	2020	Georg Loho Matthias Schymura	1
+	The Analysis of Permutations	1975	R. L. Plackett	1