暂无分享,去创建一个
[1] Pravesh Kothari,et al. Submodular functions are noise stable , 2012, SODA.
[2] R. Buck. Partition of Space , 1943 .
[3] Moshe Tennenholtz,et al. Signaling Schemes for Revenue Maximization , 2012, TEAC.
[4] Aranyak Mehta,et al. Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions , 2005, Algorithmica.
[5] Yakov Babichenko,et al. Algorithmic Aspects of Private Bayesian Persuasion , 2017, ITCS.
[6] Moshe Tennenholtz,et al. Signaling schemes for revenue maximization , 2012, EC '12.
[7] Ozan Candogan,et al. Persuasion in Networks: Public Signals and k-Cores , 2019, EC.
[8] Subhash Khot,et al. Hardness of Finding Independent Sets in Almost q-Colorable Graphs , 2012, FOCS.
[9] Krishnamurthy Iyer,et al. Signaling in Online Retail: Efficacy of Public Signals , 2018, NetEcon@SIGMETRICS.
[10] Haifeng Xu,et al. Algorithmic Persuasion with No Externalities , 2017, EC.
[11] Yang Cai,et al. Simultaneous bayesian auctions and computational complexity , 2014, EC.
[12] Renato Paes Leme,et al. Bounding the inefficiency of outcomes in generalized second price auctions , 2012, J. Econ. Theory.
[13] Shaddin Dughmi. Submodular Functions: Extensions, Distributions, and Algorithms. A Survey , 2009, ArXiv.
[14] Yakov Babichenko,et al. Private Bayesian Persuasion , 2019, J. Econ. Theory.
[15] Éva Tardos,et al. No-Regret Learning in Bayesian Games , 2015, NIPS.
[16] Stephen Morris,et al. Bayes correlated equilibrium and the comparison of information structures in games , 2016 .
[17] Gerald L. Alexanderson,et al. Arrangements of planes in space , 1981, Discret. Math..
[18] Niv Buchbinder,et al. Deterministic Algorithms for Submodular Maximization Problems , 2016, SODA.
[19] Shaddin Dughmi,et al. On the hardness of designing public signals , 2019, Games Econ. Behav..
[20] Aviad Rubinstein,et al. Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder , 2015, ICALP.
[21] David Lingenbrink,et al. Optimal Signaling Mechanisms in Unobservable Queues , 2018, Oper. Res..
[22] Tim Roughgarden,et al. Intrinsic Robustness of the Price of Anarchy , 2015, J. ACM.
[23] Yishay Mansour,et al. Bayesian Exploration: Incentivizing Exploration in Bayesian Games , 2016, EC.
[24] Haifeng Xu,et al. Information Disclosure as a Means to Security , 2015, AAMAS.
[25] Yu Cheng,et al. Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games , 2015, EC.
[26] Peter Bro Miltersen,et al. Send mixed signals: earn more, work less , 2012, EC '12.
[27] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[28] Li Han,et al. Mixture Selection, Mechanism Design, and Signaling , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[29] Haifeng Xu,et al. Algorithmic Bayesian persuasion , 2015, STOC.
[30] Pravesh Kothari,et al. Tight Bounds on ℓ1 Approximation and Learning of Self-Bounding Functions , 2017, ALT.
[31] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.