Mohammad Mahdian

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 44

Top Venues

Publications

Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Efficiency of the Generalized Second-Price Auction for Value Maximizers. WWW (2024)
Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo
Efficiency of the Generalized Second-Price Auction for Value Maximizers. CoRR (2023)
Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni
Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees. CoRR (2023)
Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni
Differentially Private Hierarchical Clustering with Provable Approximation Guarantees. ICML (2023)
Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab Mirrokni, Jon Schneider
Contextual Bandits with Cross-Learning. Math. Oper. Res. 48 (3) (2023)
Mohammad Mahdian, Jieming Mao, Kangning Wang
Regret Minimization with Noisy Observations. EC (2023)
Yangsibo Huang, Haotian Jiang, Daogao Liu, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni
Learning across Data Owners with Joint Differential Privacy. CoRR (2023)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. SODA (2022)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. SODA (2022)
Mohammad Mahdian, Jieming Mao, Kangning Wang
Regret Minimization with Noisy Observations. CoRR (2022)
Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni
Budget-Management Strategies in Repeated Auctions. Oper. Res. 69 (3) (2021)
Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. CoRR (2021)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. CoRR (2021)
Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. AISTATS (2021)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. CoRR (2021)
Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. CoRR (2021)
Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. AISTATS (2021)
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian
Fair Correlation Clustering. CoRR (2020)
Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang
Fair Hierarchical Clustering. NeurIPS (2020)
Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang
Fair Hierarchical Clustering. CoRR (2020)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Manolis Zampetakis
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. CoRR (2020)
Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS (2020)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Emmanouil Zampetakis
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. NeurIPS (2020)
Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni
Budget-Constrained Incentive Compatibility for Stationary Mechanisms. EC (2020)
Ehsan Emamjomeh-Zadeh, David Kempe, Mohammad Mahdian, Robert E. Schapire
Interactive Learning of a Dynamic Structure. ALT (2020)
Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren
Smoothly Bounding User Contributions in Differential Privacy. NeurIPS (2020)
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian
Fair Correlation Clustering. AISTATS (2020)
Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian
Visibility testing and counting for uncertain segments. Theor. Comput. Sci. 779 (2019)
Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR (2019)
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian
Clustering without Over-Representation. CoRR (2019)
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian
Clustering without Over-Representation. KDD (2019)
Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod
Response Prediction for Low-Regret Agents. CoRR (2019)
Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider
Contextual Bandits with Cross-Learning. NeurIPS (2019)
Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod
Response Prediction for Low-Regret Agents. WINE (2019)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA (2018)
Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider
Contextual Bandits with Cross-learning. CoRR (2018)
Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Song Zuo
Incentive-Aware Learning for Large Markets. WWW (2018)
Alex Fabrikant, Mohammad Mahdian, Andrew Tomkins
SCRank: Spammer and Celebrity Ranking in Directed Social Networks. CoRR (2018)
Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian
Visibility Testing and Counting for Uncertain Segments. CCCG (2017)
Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni
Budget Management Strategies in Repeated Auctions. WWW (2017)
Hoda Heidari, Mohammad Mahdian, Umar Syed, Sergei Vassilvitskii, Sadra Yazdanbod
Pricing a Low-regret Seller. ICML (2016)
Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian
Community Detection on Evolving Graphs. NIPS (2016)
Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
An Algorithmic View of Voting. SIAM J. Discret. Math. 30 (4) (2016)
Mohammad Mahdian, Mukund Sundararajan
Robust Mechanisms for Sponsored Search. EAI Endorsed Trans. Serious Games 3 (10) (2016)
Mohammad Mahdian, Okke Schrijvers, Sergei Vassilvitskii
Algorithmic Cartography: Placing Points of Interest and Ads on Maps. KDD (2015)
Arpita Ghosh, Mohammad Mahdian, R. Preston McAfee, Sergei Vassilvitskii
To Match or Not to Match: Economics of Cookie Matching in Online Advertising. ACM Trans. Economics and Comput. 3 (2) (2015)
Mohammad Mahdian, Ebadollah S. Mahmoodian
Sudoku Rectangle Completion (Extended Abstract). Electron. Notes Discret. Math. 49 (2015)
Nicole Immorlica, Mohammad Mahdian
Incentives in Large Random Two-Sided Markets. ACM Trans. Economics and Comput. 3 (3) (2015)
Ravi Kumar, Mohammad Mahdian, Bo Pang, Andrew Tomkins, Sergei Vassilvitskii
Driven by Food: Modeling Geographic Choice. WSDM (2015)
Samuel Ieong, Mohammad Mahdian, Sergei Vassilvitskii
Advertising in a stream. WWW (2014)
Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni
Composable core-sets for diversity and coverage maximization. PODS (2014)
Flavio Chierichetti, Jon M. Kleinberg, Ravi Kumar, Mohammad Mahdian, Sandeep Pandey
Event Detection via Communication Pattern Analysis. ICWSM (2014)
Flavio Chierichetti, Ravi Kumar, Mohammad Mahdian
The complexity of LSH feasibility. Theor. Comput. Sci. 530 (2014)
Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner
Designing Markets for Daily Deals. WINE (2013)
Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner
Designing Markets for Daily Deals. CoRR (2013)
Sharad Goel, David M. Pennock, Mohammad Mahdian, Daniel M. Reeves
TrustBets: betting over an IOU network. AAMAS (2012)
Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii
Ad auctions with data. INFOCOM Workshops (2012)
Arpita Ghosh, Mohammad Mahdian
Christmas Gift Exchange Games. Theory Comput. Syst. 50 (1) (2012)
Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal
PageRank on an evolving graph. KDD (2012)
A. A. Khanban, Mohammad Mahdian, Ebadollah S. Mahmoodian
A linear algebraic approach to orthogonal arrays and Latin squares. Ars Comb. 105 (2012)
Mohammad Mahdian, Arpita Ghosh, R. Preston McAfee, Sergei Vassilvitskii
To match or not to match: economics of cookie matching in online advertising. EC (2012)
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin
Algorithms on evolving graphs. ITCS (2012)
Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii
Ad Auctions with Data. SAGT (2012)
Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi
Online Optimization with Uncertain Information. ACM Trans. Algorithms 8 (1) (2012)
Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola
Special Section on Foundations of Computer Science. SIAM J. Comput. 40 (3) (2011)
Mohammad Mahdian, Ying Xu
Stochastic kronecker graphs. Random Struct. Algorithms 38 (4) (2011)
Mohammad Mahdian
Fighting censorship with algorithms. XRDS 18 (2) (2011)
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal
Sorting and selection on dynamic data. Theor. Comput. Sci. 412 (24) (2011)
Mohammad Mahdian, Qiqi Yan
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. STOC (2011)
Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee
The Multiple Attribution Problem in Pay-Per-Conversion Advertising. SAGT (2011)
Arpita Ghosh, Mohammad Mahdian
Christmas Gift Exchange Games. FUN (2010)
Sai-Ming Li, Mohammad Mahdian, Randolph Preston McAfee
Value of Learning in Sponsored Search Auctions. WINE (2010)
Mohammad Mahdian
Fighting Censorship with Algorithms. FUN (2010)
Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi
Advertisement allocation for generalized second-pricing schemes. Oper. Res. Lett. 38 (6) (2010)
Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni
Secure Overlay Network Design. Algorithmica 57 (1) (2010)
Ravi Kumar, Mohammad Mahdian, Mary McGlohon
Dynamics of conversations. KDD (2010)
Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra
Approximating Matches Made in Heaven. ICALP (1) (2009)
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal
Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) (2009)
Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman
The Minimum Distance of Turbo-Like Codes. IEEE Trans. Inf. Theory 55 (1) (2009)
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
Mechanism Design for Complexity-Constrained Bidders. WINE (2009)
Mohammad Mahdian, Grant Wang
Clustering-Based Bidding Languages for Sponsored Search. ESA (2009)
Arpita Ghosh, Mohammad Mahdian
Externalities in online advertising. WWW (2008)
Jacob Fox, Mohammad Mahdian, Rados Radoicic
Rainbow solutions to the Sidon equation. Discret. Math. 308 (20) (2008)
Mohammad Mahdian, Kerem Tomak
Pay-Per-Action Model for On-line Advertising. Int. J. Electron. Commer. 13 (2) (2008)
Arpita Ghosh, Mohammad Mahdian
Charity auctions on social networks. SODA (2008)
David Kempe, Mohammad Mahdian
A Cascade Model for Externalities in Sponsored Search. WINE (2008)
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian
Influence and correlation in social networks. KDD (2008)
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4 (2) (2008)
Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu
Deterministic Decentralized Search in Random Graphs. Internet Math. 5 (1) (2008)
Mohammad Mahdian, Randolph Preston McAfee, David M. Pennock
The Secretary Problem with a Hazard Rate Condition. WINE (2008)
Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu
Deterministic Decentralized Search in Random Graphs. WAW (2007)
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni
Robust Combinatorial Optimization with Exponential Scenarios. IPCO (2007)
Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi
Allocating online advertisement space with unreliable estimates. EC (2007)
Mohammad Mahdian, Ying Xu
Stochastic Kronecker Graphs. WAW (2007)
Nicole Immorlica, Jon M. Kleinberg, Mohammad Mahdian, Tom Wexler
The role of compatibility in the diffusion of technologies through social networks. EC (2007)
Mohammad Mahdian, Kerem Tomak
Towards a pay-per-action model in sponsored search. ICEC (2007)
Mohammad Mahdian, Kerem Tomak
Pay-per-action Model for Online Advertising. WINE (2007)
Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar
Balloon Popping With Applications to Ascending Auctions. FOCS (2007)
Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian
Dynamics of bid optimization in online advertisement auctions. WWW (2007)
Mohammad Mahdian, Kerem Tomak
Pay-per-action model for online advertising. AdKDD@KDD (2007)

Mohammad Mahdian.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mohammad Mahdian