![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mingfei Zhao
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Yang Cai
, Christopher Liaw
, Aranyak Mehta
, Mingfei Zhao
:
The Power of Two-Sided Recruitment in Two-Sided Markets. STOC 2024: 201-212 - [i13]Gagan Aggarwal, Giannis Fikioris, Mingfei Zhao:
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints. CoRR abs/2404.09832 (2024) - [i12]Gagan Aggarwal, Andrés Perlroth, Ariel Schvartzman, Mingfei Zhao:
Platform Competition in the Autobidding World. CoRR abs/2405.02699 (2024) - 2023
- [j5]Mingfei Zhao, Rui Xue
, Hang Jiang:
Precoding-based complex field network coding strategy for multi-source UAV cooperative system. EURASIP J. Adv. Signal Process. 2023(1): 3 (2023) - [c11]Zihan Tan
, Yifeng Teng
, Mingfei Zhao
:
Worst-Case Welfare of Item Pricing in the Tollbooth Problem. WWW 2023: 3508-3518 - [i11]Yang Cai, Christopher Liaw, Aranyak Mehta, Mingfei Zhao:
The Power of Two-sided Recruitment in Two-sided Markets. CoRR abs/2307.03844 (2023) - 2022
- [j4]Jia Song, Jiangcheng Su
, Yunlong Hu, Mingfei Zhao, Ke Gao
:
Stability and performance comparison analysis for linear active disturbance rejection control-based system. Trans. Inst. Meas. Control 44(10): 2037-2048 (2022) - [c10]Dirk Bergemann, Yang Cai
, Grigoris Velegkas, Mingfei Zhao:
Is Selling Complete Information (Approximately) Optimal? EC 2022: 608-663 - [c9]Yang Cai
, Argyris Oikonomou, Mingfei Zhao:
Computing simple mechanisms: Lift-and-round over marginal reduced forms. STOC 2022: 704-717 - [i10]Dirk Bergemann, Yang Cai, Grigoris Velegkas, Mingfei Zhao:
Is Selling Complete Information (Approximately) Optimal? CoRR abs/2202.09013 (2022) - 2021
- [c8]Yang Cai
, Kira Goldner
, Steven Ma, Mingfei Zhao:
On Multi-Dimensional Gains from Trade Maximization. SODA 2021: 1079-1098 - [c7]Yang Cai
, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. SODA 2021: 1337-1356 - [i9]Zihan Tan, Yifeng Teng, Mingfei Zhao:
Worst-Case Welfare of Item Pricing in the Tollbooth Problem. CoRR abs/2107.05690 (2021) - [i8]Yang Cai, Argyris Oikonomou, Mingfei Zhao:
Computing Simple Mechanisms: Lift-and-Round over Marginal Reduced Forms. CoRR abs/2111.03962 (2021) - 2020
- [j3]Rui Xue
, Mingfei Zhao
, Huaiyu Tang:
Information Transmission Schemes Based on Adaptive Coded Modulation for UAV Surveillance Systems With Satellite Relays. IEEE Access 8: 191355-191364 (2020) - [i7]Yang Cai, Kira Goldner, Steven Ma, Mingfei Zhao:
On Multi-Dimensional Gains from Trade Maximization. CoRR abs/2007.13934 (2020)
2010 – 2019
- 2019
- [c6]Yang Cai
, Mingfei Zhao:
Simple Mechanisms for Profit Maximization in Multi-item Auctions. EC 2019: 217-236 - [i6]Yang Cai, Mingfei Zhao:
Simple Mechanisms for Profit Maximization in Multi-item Auctions. CoRR abs/1906.09305 (2019) - [i5]Yang Cai, Argyris Oikonomou, Grigoris Velegkas, Mingfei Zhao:
An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. CoRR abs/1911.10172 (2019) - 2018
- [j2]Yang Cai
, Mingfei Zhao:
Simple mechanisms for subadditive buyers via duality. SIGecom Exch. 17(1): 39-53 (2018) - [c5]Likun Bian, Peng Wang, Jia Song, Mingfei Zhao:
An intelligent semi-physical simulation system for hybrid flight vehicles. ICACI 2018: 837-841 - [c4]Moshe Babaioff, Yang Cai
, Yannai A. Gonczarowski, Mingfei Zhao:
The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade. EC 2018: 373 - [i4]Moshe Babaioff, Yang Cai, Yannai A. Gonczarowski, Mingfei Zhao:
The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade. CoRR abs/1802.08023 (2018) - 2017
- [c3]Johannes Brustle, Yang Cai
, Fa Wu, Mingfei Zhao:
Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms. EC 2017: 589-590 - [c2]Yang Cai
, Mingfei Zhao:
Simple mechanisms for subadditive buyers via duality. STOC 2017: 170-183 - [i3]Johannes Brustle, Yang Cai, Fa Wu, Mingfei Zhao:
Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms. CoRR abs/1706.04637 (2017) - 2016
- [j1]Yifeng Teng, Shenghao Yang
, Siwei Wang, Mingfei Zhao:
Tight Bound on Randomness for Violating the Clauser-Horne-Shimony-Holt Inequality. IEEE Trans. Inf. Theory 62(4): 1748-1757 (2016) - [c1]Wei Chen
, Tian Lin, Zihan Tan
, Mingfei Zhao, Xuren Zhou:
Robust Influence Maximization. KDD 2016: 795-804 - [i2]Wei Chen, Tian Lin, Zihan Tan, Mingfei Zhao, Xuren Zhou:
Robust Influence Maximization. CoRR abs/1601.06551 (2016) - [i1]Yang Cai, Mingfei Zhao:
Simple Mechanisms for Subadditive Buyers via Duality. CoRR abs/1611.06910 (2016)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint