Weidong Ma

According to our database1, Weidong Ma authored at least 19 papers between 2010 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
LightGBM: A Highly Efficient Gradient Boosting Decision Tree.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Efficient Mechanism Design for Online Scheduling (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Randomized Mechanisms for Selling Reserved Instances in Cloud Computing.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Efficient Mechanism Design for Online Scheduling.
J. Artif. Intell. Res., 2016

Randomized Mechanisms for Selling Reserved Instances in Cloud.
CoRR, 2016

Budgeted Multi-Armed Bandits with Multiple Plays.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Online Non-Preemptive Story Scheduling in Web Advertising.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Balancing Load via Small Coalitions in Selfish Ring Routing Games.
APJOR, 2015

Selling Reserved Instances in Cloud Computing.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

New Mechanism for Reservation in Cloud Computing.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
The Price of Anarchy for Selfish Ring Routing is Two.
ACM Trans. Economics and Comput., 2014

Online Mechanism Design for Cloud Computing.
CoRR, 2014

Generalized second price auctions with value externalities.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Reducing price of anarchy of selfish task allocation with more selfishness.
Theor. Comput. Sci., 2013

2012
Pairwise cooperations in selfish ring routing for minimax linear latency.
Theor. Comput. Sci., 2012

The Price of Anarchy for Selfish Ring Routing is Two
CoRR, 2012

The Price of Anarchy for Selfish Ring Routing Is Two.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines.
Proceedings of the Combinatorial Optimization and Applications, 2012

2010
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations.
Proceedings of the Combinatorial Optimization and Applications, 2010


  Loading...