9 papers
Exploiting Curvature in Online Convex Optimization with Delayed Feedback
Hao Qiu, Emmanuel Esposito, Mengxiao Zhang
In this work, we study the online convex optimization problem with curved losses and delayed feedback. When losses are strongly convex, existing approaches obtain regret bounds of…
Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters
Rachael Colley, David Manlove, Daniel Paulusma +1
Kidney Exchange Programmes (KEPs) facilitate the exchange of kidneys, and larger pools of recipient-donor pairs tend to yield proportionally more transplants, leading to the propos…
Meta-mechanisms for Combinatorial Auctions over Social Networks
Yuan Fang, Mengxiao Zhang, Jiamou Liu +1
Recently there has been a large amount of research designing mechanisms for auction scenarios where the bidders are connected in a social network. Different from the existing studi…
Contextual Multinomial Logit Bandits with General Value Functions
Mengxiao Zhang, Haipeng Luo
Contextual multinomial logit (MNL) bandits capture many real-world assortment recommendation problems such as online retailing/advertising. However, prior work has only considered…
Efficient Contextual Bandits with Uninformed Feedback Graphs
Mengxiao Zhang, Yuheng Zhang, Haipeng Luo +1
Bandits with feedback graphs are powerful online learning models that interpolate between the full information and classic bandit problems, capturing many real-life applications. A…
Online Learning in Contextual Second-Price Pay-Per-Click Auctions
Mengxiao Zhang, Haipeng Luo
We study online learning in contextual pay-per-click auctions where at each of the rounds, the learner receives some context along with a set of ads and needs to make an estima…