Tentative schedule

	Monday 30/6	Tuesday 1/7	Wednesday 2/7
Morning	conference	conference	conference
Afternoon	conference	conference	forum
Evening	light reception	Banquet

Monday 30/06

start	event	complement
8:30	checkin	and coffee
9:00	opening	greetings and practical informations
9:05	keynote 1	Xiaoming Sun	TBA
9:55	short break
10:05	talk A1	Yusen Zheng, Yukun Cheng, Chenyang Xu and Xiaotie Deng	Mechanism Design for Auctions with Externalities on Budgets
10:25	talk A2	Jing Chen and Wentao Zhou	Less-excludable Mechanism for DAOs in Public Good Auctions
10:45	break	coffee
11:10	talk A3	Wu Xin, Hongyin Chen, Xiaoqi Dong, Jichen Li, Xiaotie Deng, Zhonghai Wu and Bin Xiao	TBDS: Transaction-Based Data Sharing
11:30	talk A4	Felipe Furquim, Valentin Dardilhac, Daniel Cordeiro and Johanne Cohen	Characterizing Strategyproofness Through Score Functions in Voting Mechanisms
11:50	talk A5	Zhengyan Deng, Yusen Zheng, Chenliang Sheng and Shaowen Qin	Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources
12:10	talk A6	Zhou Chen, Qi Qi, Hao Sun and Muyang Zhao	A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer
12:30	lunch break	on your own
13:30	forum 1
14:50	talk B1	Magnus Berg	Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
15:10	talk B2	Zhonghao Liu, Man Xiao, Xiaofei Liu and Weidong Li	The online power cover problem on a line
15:30	break	coffee
16:00	talk B3	Alfredo Navarra and Francesco Piselli	Oblivious Robots Under Round Robin: Gathering on Rings
16:20	talk B4	Magnus Berg, Joan Boyar, Lene M. Favrholdt and Kim S. Larsen	Complexity Classes for Online Problems with and without Predictions
16:40	short break
16:50	talk B5	Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas and Mia Persson	Multiplication of 0-1 matrices via clustering
17:10	talk B6	Felix Buld and Andreas S. Schulz	Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model
17:30	forum	Women in science
18:00	end	of talks of day 1
18:30	light reception	les Cordeliers
20:00	end	of day 1

Tuesday 1/07

start	event	complement
8:30	coffee
9:00	keynote 2	Shanghua Teng : TBA
9:50	short break
10:00	talk C1	Xujin Chen, Xiyuan Deng, Xiaodong Hu and Changjun Wang	Mixed Graph Covering with Target Constraints
10:20	talk C2	Sangram Jena and K. Subramani	From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances
10:40	break	coffee
11:10	talk C3	Shuilian Liu, Yicheng Xu and Yong Zhang	Approximation Algorithms for Individual Preference Facility Location
11:30	talk C4	Hanyin Xiao, Jiaming Zhang, Zhikang Zhang and Weidong Li	A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
11:50	talk C5	Kelin Luo, Chenran Yang, Zonghan Yang and Yuhao Zhang	The Subinterval Cover Problem
12:10	talk C6	Zifan Gong, Alexander Lam, Momcilo Mrkaic, Yachao Yan and Yingchao Zhao	The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives
12:30	lunch break	on your own
13:30	forum 2
14:30	talk D1
14:50	talk D2	Yitian Gao, Jiaxue Li, Junjie Luo and Yiheng Zhang	Minimizing Blocking Agents for Stable Matching with Partial Information
15:10	talk D3	Rufan Bai, Huahua Miao, Xiaowei Wu, Cong Zhang and Shengwei Zhou	Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Strategic Agents
15:30	break	coffee
16:00	talk D4	Junyue Zhang and Yifen Mu	A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs
16:20	talk D5	Xinxiang Guo and Yifen Mu	Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games
16:40	short break
16:50	talk D6	Bo Li, Ankang Sun and Md.Habibur Rahman Sifat	Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraint
17:10	talk D7	Ying Qin, Zeyu Ren, Zihe Wang and Jie Zhang	Fair Value Distribution in Cooperative Committee Election
17:30	end	of talks of day 2
18:30	gala dinner
20:30	end	of day 2

Wednesday 2/07

event	complement
8:30	coffee
9:00	keynote 3	Gabrielle Demange : TBA
9:50	short break
10:00	talk E1	Lusheng Wang	Finding a Set of Long Common Substrings with Repeats from m Input Strings
10:20	talk E2	Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß and Florin Manea	$k$-Universality of Regular Languages Revisited
10:40	break	coffee
11:10	talk E3	Yunxuan Ma, Yide Bian, Hao Xu, Weitao Yang, Jingshu Zhao, Zhijian Duan, Feng Wang and Xiaotie Deng	Large-Scale Contextual Market Equilibrium Computation through Deep Learning
11:30	talk E4	Hongtao Liu, Weiran Shen and Yiheng Shen	Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems
11:50	talk E5	Jingyi Liu, Jianxin Wang, Qilong Feng and Feng Shi	Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem
12:10	talk E6	Faisal Abu-Khzam and Lucas Isenmann	Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
12:30	lunch break	on your own
13:30	forum 3
14:30	forum 4
15:30	break	coffee
16:00	forum 5
17:30	end	have a safe trip home

Locations

• The conference is located in Sorbonne University, Campus Pierre et Marie Curie, 4 place Jussieu, 75005 Paris, Métro Jussieu, tower 26, floor 1, room 26-25/109
• The light reception is located in Sorbonne University, Campus les Cordeliers, 15 rue de l’École-de-médecine, 75006 Paris, Métro Odéon, room Marie-Curie. It is at walking distance from the conference site.
• The gala dinner will be in a restaurant to be announced.