Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingyu Guo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Congbo Ma
, Wei Emma Zhang, Mingyu Guo, Hu Wang, Quan Z. Sheng:
Multi-document Summarization via Deep Learning Techniques: A Survey. ACM Comput. Surv. 55(5): 102:1-102:37 (2023)- [i25]Diksha Goel, Hong Shen, Hui Tian, Mingyu Guo:
Effective Graph-Neural-Network based Models for Discovering Structural Hole Spanners in Large-Scale and Diverse Networks. CoRR abs/2302.12442 (2023) - [i24]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen:
Limited Query Graph Connectivity Test. CoRR abs/2302.13036 (2023) - [i23]Diksha Goel, Hong Shen, Hui Tian, Mingyu Guo:
Discovering Top-k Structural Hole Spanners in Dynamic Networks. CoRR abs/2302.13292 (2023) - 2022
- [j9]Mingyu Guo, Zhenghui Wang, Yuko Sakurai:
Gini index based initial coin offering mechanism. Auton. Agents Multi Agent Syst. 36(1): 7 (2022) - [j8]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of Evolutionary Diversity Optimization for Permutation Problems. ACM Trans. Evol. Learn. Optim. 2(3): 11:1-11:27 (2022) - [c42]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen:
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. AAAI 2022: 9360-9367 - [c41]Nam Trong Dinh, S. Ali Pourmousavi, Sahand Karimi-Arpanahi, Yogesh Pipada Sunil Kumar, Mingyu Guo, Derek Abbott, Jon A. R. Liisberg:
Optimal sizing and scheduling of community battery storage within a local market. e-Energy 2022: 34-46 - [c40]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Niching-based evolutionary diversity optimization for the traveling salesperson problem. GECCO 2022: 684-693 - [c39]Diksha Goel, Max Hector Ward-Graham, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo:
Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation. GECCO 2022: 1191-1199 - [c38]Masato Ota, Yuko Sakurai, Mingyu Guo, Itsuki Noda:
Mitigating Fairness and Efficiency Tradeoff in Vehicle-Dispatch Problems. PAAMS 2022: 307-319 - [i22]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem. CoRR abs/2201.10316 (2022) - [i21]Guanhua Wang, Wuli Zuo, Mingyu Guo:
Redistribution in Public Project Problems via Neural Networks. CoRR abs/2203.05778 (2022) - [i20]Diksha Goel, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo:
Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation. CoRR abs/2204.03397 (2022) - [i19]Jianshu Li, Man Luo, Jian Liu, Tao Chen, Chengjie Wang, Ziwei Liu, Shuo Liu, Kewei Yang, Xuning Shao, Kang Chen, Boyuan Liu, Mingyu Guo, Ying Guo, Yingying Ao, Pengfei Gao:
Multi-Forgery Detection Challenge 2022: Push the Frontier of Unconstrained and Diverse Forgery Detection. CoRR abs/2207.13505 (2022) - [i18]Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen:
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. CoRR abs/2212.04326 (2022) - [i17]Diksha Goel, Hong Shen, Hui Tian, Mingyu Guo:
Discovering Structural Hole Spanners in Dynamic Networks via Graph Neural Networks. CoRR abs/2212.08239 (2022) - 2021
- [j7]Mingyu Guo, Guanhua Wang, Hideaki Hata, Muhammad Ali Babar:
Revenue maximizing markets for zero-day exploits. Auton. Agents Multi Agent Syst. 35(2): 36 (2021) - [j6]Mingyu Guo:
An asymptotically optimal VCG redistribution mechanism for the public project problem. Auton. Agents Multi Agent Syst. 35(2): 40 (2021) - [c37]Guanhua Wang, Runqi Guo, Yuko Sakurai, Muhammad Ali Babar, Mingyu Guo:
Mechanism Design for Public Projects via Neural Networks. AAMAS 2021: 1380-1388 - [c36]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of evolutionary diversity optimisation for permutation problems. GECCO 2021: 574-582 - [c35]Diksha Goel, Hong Shen, Hui Tian, Mingyu Guo:
Maintenance of Structural Hole Spanners in Dynamic Networks. LCN 2021: 339-342 - [c34]Guanhua Wang, Mingyu Guo:
Public Project with Minimum Expected Release Delay. PRICAI (1) 2021: 101-112 - [c33]Guanhua Wang, Wuli Zuo, Mingyu Guo:
Redistribution in Public Project Problems via Neural Networks. WI/IAT 2021: 406-413 - [i16]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of Evolutionary Diversity Optimisation for Permutation Problems. CoRR abs/2102.11469 (2021) - [i15]Yuanhan Zhang, Zhenfei Yin, Jing Shao, Ziwei Liu, Shuo Yang, Yuanjun Xiong, Wei Xia, Yan Xu, Man Luo, Jian Liu, Jianshu Li, Zhijun Chen, Mingyu Guo, Hui Li, Junfu Liu, Pengfei Gao, Tianqi Hong, Hao Han, Shijie Liu, Xinhua Chen, Di Qiu, Cheng Zhen, Dashuang Liang, Yufeng Jin, Zhanlong Hao:
CelebA-Spoof Challenge 2020 on Face Anti-Spoofing: Methods and Results. CoRR abs/2102.12642 (2021) - [i14]Congbo Ma, Wei Emma Zhang, Hu Wang, Shubham Gupta, Mingyu Guo:
Incorporating Linguistic Knowledge for Abstractive Multi-document Summarization. CoRR abs/2109.11199 (2021) - [i13]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen:
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. CoRR abs/2112.13175 (2021) - 2020
- [i12]Guanhua Wang, Runqi Guo, Yuko Sakurai, Ali Babar, Mingyu Guo:
Mechanism Design for Public Projects via Neural Networks. CoRR abs/2002.11382 (2020) - [i11]Mingyu Guo, Zhenghui Wang, Yuko Sakurai:
Gini Index based Initial Coin Offering Mechanism. CoRR abs/2002.11387 (2020) - [i10]Mingyu Guo, Yong Yang, Muhammad Ali Babar:
Cost Sharing Security Information with Minimal Release Delay. CoRR abs/2006.14177 (2020) - [i9]Mingyu Guo, Hideaki Hata, Ali Babar:
Revenue Maximizing Markets for Zero-Day Exploits. CoRR abs/2006.14184 (2020) - [i8]Mingyu Guo, Hideaki Hata, Ali Babar:
Optimizing Affine Maximizer Auctions via Linear Programming: an Application to Revenue Maximizing Mechanism Design for Zero-Day Exploits Markets. CoRR abs/2006.14185 (2020) - [i7]Congbo Ma, Wei Emma Zhang, Mingyu Guo, Hu Wang, Quan Z. Sheng:
Multi-document Summarization via Deep Learning Techniques: A Survey. CoRR abs/2011.04843 (2020)
2010 – 2019
- 2019
- [j5]Azhar Iqbal, Lachlan J. Gunn, Mingyu Guo, Muhammad Ali Babar, Derek Abbott:
Game Theoretical Modelling of Network/Cybersecurity. IEEE Access 7: 154167-154179 (2019) - [c32]Mingyu Guo:
An Asymptotically Optimal VCG Redistribution Mechanism for the Public Project Problem. IJCAI 2019: 315-321 - [c31]Yuko Sakurai, Satoshi Oyama, Mingyu Guo, Makoto Yokoo:
Deep False-Name-Proof Auction Mechanisms. PRIMA 2019: 594-601 - [i6]Azhar Iqbal, Mingyu Guo, Lachlan J. Gunn, Muhammad Ali Babar, Derek Abbott:
Game theoretical modelling of network/cyber security [Review paper]. CoRR abs/1901.08426 (2019) - 2018
- [c30]Mingyu Guo, Yong Yang, Muhammad Ali Babar:
Cost Sharing Security Information with Minimal Release Delay. PRIMA 2018: 177-193 - 2017
- [c29]Koji Kitagawa, Mingyu Guo, Kiminao Kogiso, Hideaki Hata:
Utility design for two-player normal-form games. ASCC 2017: 2077-2082 - [c28]Hideaki Hata, Mingyu Guo, Muhammad Ali Babar:
Understanding the Heterogeneity of Contributors in Bug Bounty Programs. ESEM 2017: 223-228 - [c27]Mingyu Guo, Hong Shen:
Speed up Automated Mechanism Design by Sampling Worst-Case Profiles: An Application to Competitive VCG Redistribution Mechanism for Public Project Problem. PRIMA 2017: 127-142 - [c26]Mingyu Guo, Hideaki Hata, Muhammad Ali Babar:
Optimizing Affine Maximizer Auctions via Linear Programming: An Application to Revenue Maximizing Mechanism Design for Zero-Day Exploits Markets. PRIMA 2017: 280-292 - [c25]Tetsuya Kanda, Mingyu Guo, Hideaki Hata, Ken-ichi Matsumoto:
Towards understanding an open-source bounty: Analysis of Bountysource. SANER 2017: 577-578 - [i5]Hideaki Hata, Mingyu Guo, Muhammad Ali Babar:
Understanding the Heterogeneity of Contributors in Bug Bounty Programs. CoRR abs/1709.06224 (2017) - 2016
- [c24]Mingyu Guo, Yuko Sakurai, Taiki Todo, Makoto Yokoo:
Individually Rational Strategy-Proof Social Choice with Exogenous Indifference Sets. PRIMA 2016: 181-196 - [c23]Mingyu Guo, Hideaki Hata, Muhammad Ali Babar:
Revenue Maximizing Markets for Zero-Day Exploits. PRIMA 2016: 247-260 - [c22]Mingyu Guo:
Competitive VCG Redistribution Mechanism for Public Project Problem. PRIMA 2016: 279-294 - 2015
- [c21]Mingyu Guo, Hong Shen, Taiki Todo, Yuko Sakurai, Makoto Yokoo:
Social Decision with Minimal Efficiency Loss: An Automated Mechanism Design Approach. AAMAS 2015: 347-355 - [c20]Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Hidenao Iwane, Hirokazu Anai, Mingyu Guo, Makoto Yokoo:
Parametric Mechanism Design via Quantifier Elimination. AAMAS 2015: 1885-1886 - 2014
- [j4]Mingyu Guo, Vincent Conitzer:
Better redistribution with inefficient allocation in multi-unit auctions. Artif. Intell. 216: 287-308 (2014) - [c19]Mingyu Guo, Argyrios Deligkas, Rahul Savani:
Increasing VCG Revenue by Decreasing the Quality of Items. AAAI 2014: 705-711 - [c18]Shunsuke Tsuruta, Masaaki Oka, Taiki Todo, Yujiro Kawasaki, Mingyu Guo, Yuko Sakurai, Makoto Yokoo:
Optimal false-name-proof single-item redistribution mechanisms. AAMAS 2014: 221-228 - 2013
- [j3]Mingyu Guo, Evangelos Markakis, Krzysztof R. Apt, Vincent Conitzer:
Undominated Groves Mechanisms. J. Artif. Intell. Res. 46: 129-163 (2013) - [c17]Mingyu Guo, Argyrios Deligkas:
Revenue Maximization via Hiding Item Attributes. IJCAI 2013: 157-163 - [i4]Mingyu Guo, Argyrios Deligkas:
Revenue Maximization via Hiding Item Attributes. CoRR abs/1302.5332 (2013) - 2012
- [c16]Mingyu Guo:
Worst-case optimal redistribution of VCG payments in heterogeneous-item auctions with unit demand. AAMAS 2012: 745-752 - [c15]Victor Naroditskiy, Mingyu Guo, Lachlan Dufton, Maria Polukarov, Nicholas R. Jennings:
Redistribution of VCG Payments in Public Project Problems. WINE 2012: 323-336 - [i3]Mingyu Guo, Evangelos Markakis, Krzysztof R. Apt, Vincent Conitzer:
Undominated Groves Mechanisms. CoRR abs/1203.1809 (2012) - [i2]Mingyu Guo, Vincent Conitzer:
False-name-proofness with Bid Withdrawal. CoRR abs/1208.6501 (2012) - 2011
- [c14]Mingyu Guo:
VCG Redistribution with Gross Substitutes. AAAI 2011 - [c13]Mingyu Guo, Victor Naroditskiy, Vincent Conitzer, Amy Greenwald, Nicholas R. Jennings:
Budget-Balanced and Nearly Efficient Randomized Mechanisms: Public Goods and beyond. WINE 2011: 158-169 - 2010
- [b1]Mingyu Guo:
Computationally Feasible Approaches to Automated Mechanism Design. Duke University, Durham, NC, USA, 2010 - [j2]Mingyu Guo, Vincent Conitzer:
Optimal-in-expectation redistribution mechanisms. Artif. Intell. 174(5-6): 363-381 (2010) - [c12]Mingyu Guo, Vincent Conitzer:
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies. AAAI 2010 - [c11]Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori, Yuko Sakurai, Taiki Todo, Mingyu Guo, Makoto Yokoo:
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms. AAMAS 2010: 633-640 - [c10]Mingyu Guo, Vincent Conitzer:
Strategy-proof allocation of multiple items between two agents without payments or priors. AAMAS 2010: 881-888 - [c9]Mingyu Guo, Vincent Conitzer:
False-name-proofness with bid withdrawal. AAMAS 2010: 1475-1476
2000 – 2009
- 2009
- [j1]Mingyu Guo, Vincent Conitzer:
Worst-case optimal redistribution of VCG payments in multi-unit auctions. Games Econ. Behav. 67(1): 69-98 (2009) - [c8]Mingyu Guo, David M. Pennock:
Combinatorial prediction markets for event hierarchies. AAMAS (1) 2009: 201-208 - [c7]Peng Shi, Vincent Conitzer, Mingyu Guo:
Prediction Mechanisms That Do Not Incentivize Undesirable Actions. WINE 2009: 89-100 - [c6]Mingyu Guo, Vincent Conitzer, Daniel M. Reeves:
Competitive Repeated Allocation without Payments. WINE 2009: 244-255 - 2008
- [c5]Mingyu Guo, Vincent Conitzer:
Undominated VCG redistribution mechanisms. AAMAS (2) 2008: 1039-1046 - [c4]Mingyu Guo, Vincent Conitzer:
Optimal-in-expectation redistribution mechanisms. AAMAS (2) 2008: 1047-1054 - [c3]Mingyu Guo, Vincent Conitzer:
Better redistribution with inefficient allocation in multi-unit auctions with unit demand. EC 2008: 210-219 - [c2]Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Evangelos Markakis:
Welfare Undominated Groves Mechanisms. WINE 2008: 426-437 - [i1]Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Evangelos Markakis:
Welfare Undominated Groves Mechanisms. CoRR abs/0810.2865 (2008) - 2007
- [c1]Mingyu Guo, Vincent Conitzer:
Worst-case optimal redistribution of VCG payments. EC 2007: 30-39
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-03-25 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
