Vahab Mirrokni focuses on Approximation algorithm, Mathematical optimization, Combinatorics, Combinatorial optimization and Submodular set function. Vahab Mirrokni has included themes like Maximization and Bipartite graph, Graph in his Approximation algorithm study. The concepts of his Mathematical optimization study are interwoven with issues in Competitive analysis and Price of anarchy.
In general Combinatorics, his work in Graph theory is often linked to K-independent hashing, Feature hashing and Dynamic perfect hashing linking many areas of study. His Combinatorial optimization research is multidisciplinary, incorporating perspectives in Combinatorial optimization problem, Purchasing and Matroid. He focuses mostly in the field of Submodular set function, narrowing it down to topics relating to Maximum cut and, in certain cases, Constraint satisfaction problem.
The scientist’s investigation covers issues in Mathematical optimization, Common value auction, Approximation algorithm, Combinatorics and Microeconomics. His Mathematical optimization study frequently draws parallels with other fields, such as Mechanism design. His Common value auction study integrates concerns from other disciplines, such as Online advertising, Budget constraint, Incentive, Incentive compatibility and Regret.
The Approximation algorithm study which covers Cluster analysis that intersects with Data mining. Vahab Mirrokni interconnects Discrete mathematics and Upper and lower bounds in the investigation of issues within Combinatorics. His Nash equilibrium study combines topics from a wide range of disciplines, such as Game theory and Price of anarchy.
His scientific interests lie mostly in Mathematical optimization, Common value auction, Mechanism design, Microeconomics and Bidding. His studies in Mathematical optimization integrate themes in fields like Time complexity, Exponential time hypothesis and Reservation price. His work in Common value auction tackles topics such as Regret which are related to areas like Probability distribution, Revenue management, Artificial neural network, Crowdsourcing and Artificial intelligence.
His studies deal with areas such as Reduction, Participation constraint and Limit as well as Mechanism design. His work on Bid shading, Profit and Incentive as part of his general Microeconomics study is frequently connected to Value, thereby bridging the divide between different branches of science. As part of the same scientific family, Vahab Mirrokni usually focuses on Bidding, concentrating on Budget constraint and intersecting with Entropy.
His primary areas of investigation include Mathematical optimization, Common value auction, Bidding, Theoretical computer science and Revenue management. His work often combines Mathematical optimization and Power studies. His Common value auction research is multidisciplinary, incorporating elements of Display advertising, Online advertising, Knowledge management and Incentive, Incentive compatibility.
His Bidding research includes themes of Entropy and Budget constraint. His Theoretical computer science study integrates concerns from other disciplines, such as Leverage, Object, Propensity score matching, Causal inference and Causal model. His Revenue management research incorporates elements of Probability distribution, Regret and Dual.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar;Nicole Immorlica;Piotr Indyk;Vahab S. Mirrokni.
symposium on computational geometry (2004)
Maximizing Non-monotone Submodular Functions
Uriel Feige;Vahab S. Mirrokni;Jan Vondrák.
SIAM Journal on Computing (2011)
Optimal marketing strategies over social networks
Jason Hartline;Vahab Mirrokni;Mukund Sundararajan.
the web conference (2008)
Tight approximation algorithms for maximum general assignment problems
Lisa Fleischer;Michel X. Goemans;Vahab S. Mirrokni;Maxim Sviridenko.
symposium on discrete algorithms (2006)
Maximizing Non-Monotone Submodular Functions
U. Feigc;V.S. Mirrokni;J. Vondrak.
foundations of computer science (2007)
Market sharing games applied to content distribution in ad hoc networks
M.X. Goemans;Li Li;V.S. Mirrokni;M. Thottan.
IEEE Journal on Selected Areas in Communications (2006)
Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks
Mohsen Bahramgiri;Mohammadtaghi Hajiaghayi;Vahab S. Mirrokni.
Wireless Networks (2006)
Trust-based recommendation systems: an axiomatic approach
Reid Andersen;Christian Borgs;Jennifer Chayes;Uriel Feige.
the web conference (2008)
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee;Vahab S. Mirrokni;Viswanath Nagarajan;Maxim Sviridenko.
symposium on the theory of computing (2009)
Online Stochastic Matching: Beating 1-1/e
Jon Feldman;Aranyak Mehta;Vahab Mirrokni;S. Muthukrishnan.
foundations of computer science (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: