We stand with Ukraine

We stand with Ukraine

Cong Chen

Orcid: 0000-0003-4334-3727

Affiliations:

Guangzhou University, School of Management, Guangzhou, China
South China University of Technology, School of Business Administration, Guangzhou, China
Xi'an Jiaotong University, School of Management, China
ETH Zurich, Department of Computer Science, Zürich, Switzerland

According to our database¹, Cong Chen authored at least 10 papers between 2015 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org

On csauthors.net:

Bibliography

2024

Sequential solutions in machine scheduling games.

[BibT_eX]

[DOI]

,

,

Akaki Mamageishvili

,

Matús Mihalák

,

J. Sched., August, 2024

The price of anarchy for a berth allocation game.

[BibT_eX]

[DOI]

,

,

J. Sched., February, 2024

2022

Online machine minimization with lookahead.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2022

2020

Coordination mechanisms for scheduling selfish jobs with favorite machines.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2020

Online scheduling of jobs with favorite machines.

[BibT_eX]

[DOI]

,

,

Comput. Oper. Res., 2020

The Curse of Rationality in Sequential Scheduling Games.

[BibT_eX]

[DOI]

,

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019

Selfish load balancing for jobs with favorite machines.

[BibT_eX]

[DOI]

,

Oper. Res. Lett., 2019

2017

Online MapReduce scheduling problem of minimizing the makespan.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2017

Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy.

[BibT_eX]

[DOI]

,

,

Proceedings of the Combinatorial Optimization and Applications, 2017

2015

Searching Graph Communities by Modularity Maximization via Convex Optimization.

[BibT_eX]

[DOI]

,

,

,

,

Proceedings of the Combinatorial Optimization and Applications, 2015

Loading...