default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Nisan
Person information
- affiliation: Hebrew University of Jerusalem, Israel
- award (2016): Knuth Prize
- award (2012): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i63]Moshe Babaioff, Amitai Frey, Noam Nisan:
Learning to Maximize Gains From Trade in Small Markets. CoRR abs/2401.11596 (2024)- 2023
- [c121]Yoav Kolumbus, Menahem Levy, Noam Nisan:
Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial Scheduling. NeurIPS 2023 - [i62]Yoav Kolumbus, Menahem Levy, Noam Nisan:
Asynchronous Proportional Response Dynamics in Markets with Adversarial Scheduling. CoRR abs/2307.04108 (2023) - [i61]Noam Nisan:
Serial Monopoly on Blockchains. CoRR abs/2311.12731 (2023) - 2022
- [j69]Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan:
The menu-size complexity of revenue approximation. Games Econ. Behav. 134: 281-307 (2022) - [c120]Simina Brânzei, Noam Nisan:
The Query Complexity of Cake Cutting. NeurIPS 2022 - [c119]Yoav Kolumbus, Noam Nisan:
How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents. NeurIPS 2022 - [c118]Matan Gilboa, Noam Nisan:
Complexity of Public Goods Games on Graphs. SAGT 2022: 151-168 - [c117]Yoav Kolumbus, Noam Nisan:
Auctions between Regret-Minimizing Agents. WWW 2022: 100-111 - [i60]Ron Kupfer, Noam Nisan:
Finding a Hidden Edge. CoRR abs/2207.02344 (2022) - [i59]Matan Gilboa, Noam Nisan:
Complexity of Public Goods Games on Graphs. CoRR abs/2207.04238 (2022) - [i58]Ran Ben Moshe, Sergiu Hart, Noam Nisan:
Monotonic Mechanisms for Selling Multiple Goods. CoRR abs/2210.17150 (2022) - 2021
- [j68]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen
:
Competitive Equilibrium with Indivisible Goods and Generic Budgets. Math. Oper. Res. 46(1): 382-403 (2021) - [c116]Noam Nisan:
The Demand Query Model for Bipartite Matching. SODA 2021: 592-599 - [c115]Gal Beniamini, Noam Nisan:
Bipartite perfect matching as a real polynomial. STOC 2021: 1118-1131 - [c114]Moshe Babaioff, Ruty Mundel, Noam Nisan:
Beyond Pigouvian Taxes: A Worst Case Analysis. WINE 2021: 226-243 - [i57]Moshe Babaioff, Ruty Mundel, Noam Nisan:
Beyond Pigouvian Taxes: A Worst Case Analysis. CoRR abs/2107.12023 (2021) - [i56]Yoav Kolumbus, Noam Nisan:
Auctions Between Regret-Minimizing Agents. CoRR abs/2110.11855 (2021) - [i55]Yoav Kolumbus, Noam Nisan:
How and Why to Manipulate Your Own Agent. CoRR abs/2112.07640 (2021) - 2020
- [c113]Michal Feldman, Yishay Mansour, Noam Nisan, Sigal Oren, Moshe Tennenholtz:
Designing Committees for Mitigating Biases. AAAI 2020: 1942-1949 - [i54]Gal Beniamini, Noam Nisan:
Bipartite Perfect Matching as a Real Polynomial. CoRR abs/2001.07642 (2020) - [i53]Yoav Kolumbus, Noam Nisan:
On the Effectiveness of Tracking and Testing in SEIR Models. CoRR abs/2007.06291 (2020)
2010 – 2019
- 2019
- [j67]Shahar Dobzinski, Noam Nisan, Sigal Oren:
Economic efficiency requires interaction. Games Econ. Behav. 118: 589-608 (2019) - [j66]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A stable marriage requires communication. Games Econ. Behav. 118: 626-647 (2019) - [j65]Sergiu Hart, Noam Nisan:
Selling multiple correlated goods: Revenue maximization and menu-size complexity. J. Econ. Theory 183: 991-1029 (2019) - [c112]Yannai A. Gonczarowski, Noam Nisan, Lior Kovalio, Assaf Romm:
Matching for the Israeli: Handling Rich Diversity Requirements. EC 2019: 321 - [c111]Simina Brânzei, Noam Nisan:
Communication Complexity of Cake Cutting. EC 2019: 525 - [c110]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Fair Allocation through Competitive Equilibrium from Generic Incomes. FAT 2019: 180 - [c109]Yakov Babichenko, Shahar Dobzinski, Noam Nisan:
The communication complexity of local search. STOC 2019: 650-661 - [i52]Yannai A. Gonczarowski, Lior Kovalio, Noam Nisan, Assaf Romm:
Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements. CoRR abs/1905.00364 (2019) - [i51]Noam Nisan:
The Demand Query Model for Bipartite Matching. CoRR abs/1906.04213 (2019) - [i50]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Competitive Equilibrium with Generic Budgets: Beyond Additive. CoRR abs/1911.09992 (2019) - 2018
- [j64]Sergiu Hart, Noam Nisan:
The query complexity of correlated equilibria. Games Econ. Behav. 108: 401-410 (2018) - [j63]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public Projects, Boolean Functions, and the Borders of Border's Theorem. ACM Trans. Economics and Comput. 6(3-4): 18:1-18:21 (2018) - [c108]Simina Brânzei, Ruta Mehta, Noam Nisan:
Universal Growth in Production Economies. NeurIPS 2018: 1975 - [c107]Moshe Babaioff, Noam Nisan, Aviad Rubinstein:
Optimal Deterministic Mechanisms for an Additive Buyer. EC 2018: 429 - [i49]Simina Brânzei, Ruta Mehta, Noam Nisan:
Universal Growth in Production Economies. CoRR abs/1802.07385 (2018) - [i48]Yakov Babichenko, Shahar Dobzinski, Noam Nisan:
The Communication Complexity of Local Search. CoRR abs/1804.02676 (2018) - [i47]Moshe Babaioff, Noam Nisan, Aviad Rubinstein:
Optimal Deterministic Mechanisms for an Additive Buyer. CoRR abs/1804.06867 (2018) - 2017
- [j62]Sergiu Hart, Noam Nisan:
Approximate revenue maximization with multiple items. J. Econ. Theory 172: 313-347 (2017) - [c106]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Selling Complementary Goods: Dynamics, Efficiency and Revenue. ICALP 2017: 134:1-134:14 - [c105]Noam Nisan, Gali Noti:
A "Quantal Regret" Method for Structural Econometrics in Repeated Games. EC 2017: 123 - [c104]Yannai A. Gonczarowski, Noam Nisan:
Efficient empirical revenue maximization in single-parameter auction environments. STOC 2017: 856-868 - [c103]Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan:
The menu-size complexity of revenue approximation. STOC 2017: 869-877 - [c102]Noam Nisan, Gali Noti:
An Experimental Evaluation of Regret-Based Econometrics. WWW 2017: 73-81 - [c101]Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat:
ERA: A Framework for Economic Resource Allocation for the Cloud. WWW (Companion Volume) 2017: 635-642 - [i46]Noam Nisan, Gali Noti:
A "Quantal Regret" Method for Structural Econometrics in Repeated Games. CoRR abs/1702.04254 (2017) - [i45]Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat:
ERA: A Framework for Economic Resource Allocation for the Cloud. CoRR abs/1702.07311 (2017) - [i44]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Competitive Equilibria with Indivisible Goods and Generic Budgets. CoRR abs/1703.08150 (2017) - [i43]Simina Brânzei, Noam Nisan:
The Query Complexity of Cake Cutting. CoRR abs/1705.02946 (2017) - [i42]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Selling Complementary Goods: Dynamics, Efficiency and Revenue. CoRR abs/1706.00219 (2017) - [i41]Simina Brânzei, Noam Nisan:
Communication Complexity of Cake Cutting. CoRR abs/1709.09876 (2017) - 2016
- [j61]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game. ACM Trans. Economics and Comput. 5(1): 1:1-1:22 (2016) - [c100]Noam Nisan:
Knuth Prize Lecture: Complexity of Communication in Markets. FOCS 2016: 385 - [c99]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Networks of Complements. ICALP 2016: 140:1-140:14 - [c98]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS 2016: 59-70 - [c97]Michal Feldman, Brendan Lucier, Noam Nisan:
Correlated and Coarse Equilibria of Single-Item Auctions. WINE 2016: 131-144 - [i40]Michal Feldman, Brendan Lucier, Noam Nisan:
Correlated- and Coarse- equilibria of Single-item auctions. CoRR abs/1601.07702 (2016) - [i39]Moshe Babaioff, Yannai A. Gonczarowski, Noam Nisan:
The Menu-Size Complexity of Revenue Approximation. CoRR abs/1604.06580 (2016) - [i38]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Networks of Complements. CoRR abs/1605.00136 (2016) - [i37]Noam Nisan, Gali Noti:
An Experimental Evaluation of Regret-Based Econometrics. CoRR abs/1605.03838 (2016) - [i36]Yannai A. Gonczarowski, Noam Nisan:
Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments. CoRR abs/1610.09976 (2016) - 2015
- [j60]Shahar Dobzinski, Noam Nisan:
Multi-unit auctions: Beyond Roberts. J. Econ. Theory 156: 14-44 (2015) - [j59]Ron Lavi, Noam Nisan:
Online ascending auctions for gradually expiring items. J. Econ. Theory 156: 45-76 (2015) - [c96]Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. FOCS 2015: 1499-1512 - [c95]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public Projects, Boolean Functions, and the Borders of Border's Theorem. EC 2015: 395 - [c94]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A Stable Marriage Requires Communication. SODA 2015: 1003-1017 - [i35]Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. CoRR abs/1504.01780 (2015) - [i34]Parikshit Gopalan, Noam Nisan, Tim Roughgarden:
Public projects, Boolean functions and the borders of Border's theorem. CoRR abs/1504.07687 (2015) - [i33]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR abs/1508.02420 (2015) - [i32]Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. Electron. Colloquium Comput. Complex. TR15 (2015) - [i31]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c93]Moshe Babaioff, Brendan Lucier, Noam Nisan, Renato Paes Leme:
On the efficiency of the walrasian mechanism. EC 2014: 783-800 - [c92]Shahar Dobzinski, Noam Nisan, Sigal Oren:
Economic efficiency requires interaction. STOC 2014: 233-242 - [c91]Shaddin Dughmi, Li Han, Noam Nisan:
Sampling and Representation Complexity of Revenue Maximization. WINE 2014: 277-291 - [c90]Gali Noti, Noam Nisan, Ilan Yaniv:
An experimental evaluation of bidders' behavior in ad auctions. WWW 2014: 619-630 - [c89]Moshe Babaioff, Noam Nisan, Renato Paes Leme:
Price competition in online combinatorial markets. WWW 2014: 711-722 - [i30]Moshe Babaioff, Noam Nisan, Renato Paes Leme:
Price Competition in Online Combinatorial Markets. CoRR abs/1401.1559 (2014) - [i29]Shahar Dobzinski, Noam Nisan:
Mechanisms for Multi-Unit Auctions. CoRR abs/1401.3834 (2014) - [i28]Moshe Babaioff, Michal Feldman, Noam Nisan:
Mixed Strategies in Combinatorial Agency. CoRR abs/1401.3837 (2014) - [i27]Shaddin Dughmi, Li Han, Noam Nisan:
Sampling and Representation Complexity of Revenue Maximization. CoRR abs/1402.4535 (2014) - [i26]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A Stable Marriage Requires Communication. CoRR abs/1405.7709 (2014) - 2013
- [j58]Michal Feldman, Noam Nisan:
Introduction to the Special Issue on Algorithmic Game Theory. ACM Trans. Economics and Comput. 1(2): 5:1 (2013) - [c88]Moshe Babaioff, Brendan Lucier, Noam Nisan:
Bertrand networks. EC 2013: 33-34 - [c87]Sergiu Hart, Noam Nisan:
The menu-size complexity of auctions. EC 2013: 565-566 - [i25]Sergiu Hart, Noam Nisan:
The Menu-Size Complexity of Auctions. CoRR abs/1304.6116 (2013) - [i24]Moshe Babaioff, Brendan Lucier, Noam Nisan:
Bertrand Networks. CoRR abs/1304.6806 (2013) - [i23]Sergiu Hart, Noam Nisan:
The Query Complexity of Correlated Equilibria. CoRR abs/1305.4874 (2013) - [i22]Moshe Babaioff, Brendan Lucier, Noam Nisan, Renato Paes Leme:
On the Efficiency of the Walrasian Mechanism. CoRR abs/1311.0924 (2013) - [i21]Shahar Dobzinski, Noam Nisan, Sigal Oren:
Economic Efficiency Requires Interaction. CoRR abs/1311.4721 (2013) - [i20]Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold Vöcking:
Electronic Markets and Auctions (Dagstuhl Seminar 13461). Dagstuhl Reports 3(11): 58-78 (2013) - 2012
- [j57]Shahar Dobzinski, Ron Lavi, Noam Nisan:
Multi-unit auctions with budget limits. Games Econ. Behav. 74(2): 486-503 (2012) - [j56]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci. 78(1): 15-25 (2012) - [j55]Moshe Babaioff, Michal Feldman, Noam Nisan, Eyal Winter:
Combinatorial agency. J. Econ. Theory 147(3): 999-1034 (2012) - [c86]Avital Gutman, Noam Nisan:
Fair allocation without trade. AAMAS 2012: 719-728 - [c85]Sergiu Hart, Noam Nisan:
Approximate revenue maximization with multiple items. EC 2012: 656 - [c84]Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden:
Sketching valuation functions. SODA 2012: 1025-1035 - [c83]Avishay Maya, Noam Nisan:
Incentive Compatible Two Player Cake Cutting. WINE 2012: 170-183 - [c82]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR Game: Equilibrium Characterization - (Working Paper). WINE 2012: 561 - [i19]Yishay Mansour, S. Muthukrishnan, Noam Nisan:
Doubleclick Ad Exchange Auction. CoRR abs/1204.0535 (2012) - [i18]Sergiu Hart, Noam Nisan:
Approximate Revenue Maximization with Multiple Items. CoRR abs/1204.1846 (2012) - [i17]Avital Gutman, Noam Nisan:
Fair Allocation Without Trade. CoRR abs/1204.4286 (2012) - [i16]Avishay Maya, Noam Nisan:
Incentive Compatible Two Player Cake Cutting. CoRR abs/1210.0155 (2012) - [i15]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
The AND-OR game: Equilibrium Characterization (Working Paper). CoRR abs/1210.1757 (2012) - 2011
- [j54]Shahar Dobzinski, Noam Nisan:
Limitations of VCG-based mechanisms. Comb. 31(4): 379-396 (2011) - [j53]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan:
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. 40(3): 934-952 (2011) - [j52]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
When is it best to best-respond? SIGecom Exch. 10(2): 16-18 (2011) - [c81]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
Best-Response Mechanisms. ICS 2011: 155-165 - [c80]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
Incentive-compatible distributed greedy protocols. PODC 2011: 335-336 - [c79]Shahar Dobzinski, Noam Nisan:
Multi-unit auctions: beyond roberts. EC 2011: 233-242 - [c78]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-price equilibria in markets of discrete goods. EC 2011: 295-296 - [c77]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
Best-response auctions. EC 2011: 351-360 - [p2]Oded Goldreich, Leonid A. Levin, Noam Nisan:
On Constructing 1-1 One-Way Functions. Studies in Complexity and Cryptography 2011: 13-25 - [p1]Oded Goldreich, Noam Nisan, Avi Wigderson:
On Yao's XOR-Lemma. Studies in Complexity and Cryptography 2011: 273-301 - [i14]Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Noam Nisan:
Non-Price Equilibria in Markets of Discrete Goods. CoRR abs/1103.3950 (2011) - [i13]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan:
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. CoRR abs/1105.5129 (2011) - [i12]Moshe Babaioff, Noam Nisan:
Concurrent Auctions Across The Supply Chain. CoRR abs/1107.0028 (2011) - [i11]Noam Nisan, Amir Ronen:
Computationally Feasible VCG Mechanisms. CoRR abs/1110.0025 (2011) - [i10]Liad Blumrosen, Noam Nisan, Ilya Segal:
Auctions with Severely Bounded Communication. CoRR abs/1110.2733 (2011) - 2010
- [j51]Shahar Dobzinski, Noam Nisan:
Mechanisms for Multi-Unit Auctions. J. Artif. Intell. Res. 37: 85-98 (2010) - [j50]Moshe Babaioff, Michal Feldman, Noam Nisan:
Mixed Strategies in Combinatorial Agency. J. Artif. Intell. Res. 38: 339-369 (2010) - [j49]Liad Blumrosen, Noam Nisan:
Informational limitations of ascending combinatorial auctions. J. Econ. Theory 145(3): 1203-1223 (2010) - [j48]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. Math. Oper. Res. 35(1): 1-13 (2010) - [c76]Noam Nisan:
Google's Auction for TV Ads. SODA 2010: 741 - [i9]Shahar Dobzinski, Noam Nisan:
Multi-Unit Auctions: Beyond Roberts. CoRR abs/1004.1449 (2010)
2000 – 2009
- 2009
- [j47]Moshe Babaioff, Noam Nisan, Elan Pavlov:
Mechanisms for a spatially distributed market. Games Econ. Behav. 66(2): 660-684 (2009) - [j46]Ron Lavi, Ahuva Mu'alem, Noam Nisan:
Two simplified proofs for Roberts' theorem. Soc. Choice Welf. 32(3): 407-423 (2009) - [j45]Liad Blumrosen, Noam Nisan:
On the Computational Power of Demand Queries. SIAM J. Comput. 39(4): 1372-1391 (2009) - [c75]Noam Nisan:
Google's Auction for TV Ads. ESA 2009: 553 - [c74]Noam Nisan, Jason Bayer, Deepak Chandra, Tal Franji, Robert Gardner, Yossi Matias, Neil Rhodes, Misha Seltzer, Danny Tom, Hal R. Varian, Dan Zigmond:
Google's Auction for TV Ads. ICALP (2) 2009: 309-327 - [c73]Shahar Dobzinski, Noam Nisan:
A Modular Approach to Roberts' Theorem. SAGT 2009: 14-23 - [c72]Moshe Babaioff, Michal Feldman, Noam Nisan:
Free-Riding and Free-Labor in Combinatorial Agency. SAGT 2009: 109-121 - [c71]Shimon Schocken, Noam Nisan, Michal Armoni:
A synthesis course in hardware architecture, compilers, and software engineering. SIGCSE 2009: 443-447 - 2008
- [b4]Noam Nisan, Shimon Schocken:
The Elements of Computing Systems - Building a Modern Computer from First Principles. MIT Press 2008, ISBN 978-0-262-64068-8, pp. I-XIV, 1-324 - [j44]Ahuva Mu'alem, Noam Nisan:
Truthful approximation mechanisms for restricted combinatorial auctions. Games Econ. Behav. 64(2): 612-631 (2008) - [j43]Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos:
Theory research at Google. SIGACT News 39(2): 10-28 (2008) - [j42]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4(3): 37:1-37:12 (2008) - [c70]Assaf Ben-David, Noam Nisan, Benny Pinkas:
FairplayMP: a system for secure multi-party computation. CCS 2008: 257-266 - [c69]Ehud Friedgut, Gil Kalai, Noam Nisan:
Elections Can be Manipulated Often. FOCS 2008: 243-249 - [c68]Shahar Dobzinski, Ron Lavi, Noam Nisan:
Multi-unit Auctions with Budget Limits. FOCS 2008: 260-269 - [c67]Noam Nisan, Michael Schapira, Aviv Zohar:
Asynchronous Best-Reply Dynamics. WINE 2008: 531-538 - 2007
- [j41]Liad Blumrosen, Noam Nisan, Ilya Segal:
Auctions with Severely Bounded Communication. J. Artif. Intell. Res. 28: 233-266 (2007) - [j40]Noam Nisan, Amir Ronen:
Computationally Feasible VCG Mechanisms. J. Artif. Intell. Res. 29: 19-47 (2007) - [c66]Shahar Dobzinski, Noam Nisan:
Mechanisms for multi-unit auctions. EC 2007: 346-351 - [c65]Shahar Dobzinski, Noam Nisan:
Limitations of VCG-based mechanisms. STOC 2007: 338-344 - [e2]Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani:
Algorithmic Game Theory. Cambridge University Press 2007, ISBN 9780511800481 - 2006
- [j39]Benny Lehmann, Daniel Lehmann, Noam Nisan:
Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2): 270-296 (2006) - [j38]Noam Nisan, Ilya Segal:
The communication requirements of efficient allocations and supporting prices. J. Econ. Theory 129(1): 192-224 (2006) - [c64]Moshe Babaioff, Michal Feldman, Noam Nisan:
Combinatorial agency. EC 2006: 18-28 - [c63]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Truthful randomized mechanisms for combinatorial auctions. STOC 2006: 644-652 - [c62]Moshe Babaioff, Michal Feldman, Noam Nisan:
Mixed Strategies in Combinatorial Agency. WINE 2006: 353-364 - [i8]Shahar Dobzinski, Noam Nisan:
Approximations by Computationally-Efficient VCG-Based Mechanisms. Electron. Colloquium Comput. Complex. TR06 (2006) - [i7]Noam Nisan:
A Note on the computational hardness of evolutionary stable strategies. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [b3]Noam Nisan, Shimon Schocken:
The Elements of Computing Systems - Building a Modern Computer from First Principles. MIT Press 2005, ISBN 978-0-262-14087-4, pp. I-XIV, 1-324 - [c61]Liad Blumrosen, Noam Nisan:
On the computational power of iterative auctions. EC 2005: 29-43 - [c60]Ron Lavi, Noam Nisan:
Online ascending auctions for gradually expiring items. SODA 2005: 1146-1155 - [c59]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Approximation algorithms for combinatorial auctions with complement-free bidders. STOC 2005: 610-618 - [c58]Noam Nisan, Ilya Segal:
Exponential communication inefficiency of demand queries. TARK 2005: 158-164 - 2004
- [j37]Moshe Babaioff, Noam Nisan:
Concurrent Auctions Across The Supply Chain. J. Artif. Intell. Res. 21: 595-629 (2004) - [j36]Ron Lavi, Noam Nisan:
Competitive analysis of incentive compatible on-line auctions. Theor. Comput. Sci. 310(1-3): 159-180 (2004) - [c57]Moshe Babaioff, Noam Nisan, Elan Pavlov:
Mechanisms for a spatially distributed market. EC 2004: 9-20 - [c56]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. SPAA 2004: 20-24 - [c55]Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella:
Fairplay - Secure Two-Party Computation System. USENIX Security Symposium 2004: 287-302 - 2003
- [c54]Liad Blumrosen, Noam Nisan, Ilya Segal:
Multi-player and Multi-round Auctions with Severely Bounded Communication. ESA 2003: 102-113 - [c53]Ron Lavi, Ahuva Mu'alem, Noam Nisan:
Towards a Characterization of Truthful Combinatorial Auctions. FOCS 2003: 574-583 - [c52]Yair Bartal, Rica Gonen, Noam Nisan:
Incentive compatible multi unit combinatorial auctions. TARK 2003: 72-87 - [e1]Daniel A. Menascé, Noam Nisan:
Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003. ACM 2003, ISBN 1-58113-679-X [contents] - 2002
- [c51]Ahuva Mu'alem, Noam Nisan:
Truthful Approximation Mechanisms for Restricted Combinatorial Auctions. AAAI/IAAI 2002: 379-384 - [c50]Liad Blumrosen, Noam Nisan:
Auctions with Severely Bounded Communication. FOCS 2002: 406-415 - [c49]Noam Nisan:
The Communication Complexity of Approximate Set Packing and Covering. ICALP 2002: 868-875 - [i6]Benny Lehmann, Daniel Lehmann, Noam Nisan:
Combinatorial Auctions with Decreasing Marginal Utilities. CoRR cs.GT/0202015 (2002) - 2001
- [j35]Ilan Kremer, Noam Nisan, Dana Ron:
Errata for: "On randomized one-round communication complexity". Comput. Complex. 10(4): 314-315 (2001) - [j34]Noam Nisan, Amir Ronen:
Algorithmic Mechanism Design. Games Econ. Behav. 35(1-2): 166-196 (2001) - [j33]Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas:
Neighborhood Preserving Hashing and Approximate Queries. SIAM J. Discret. Math. 15(1): 73-85 (2001) - [c48]Moshe Babaioff, Noam Nisan:
Concurrent auctions across the supply chain. EC 2001: 1-10 - [c47]Benny Lehmann, Daniel Lehmann, Noam Nisan:
Combinatorial auctions with decreasing marginal utilities. EC 2001: 18-28 - [c46]Edo Zurel, Noam Nisan:
An efficient approximate allocation algorithm for combinatorial auctions. EC 2001: 125-136 - [c45]Lior Levy, Liad Blumrosen, Noam Nisan:
On-Line Markets for Distributed Object Services: The MAJIC System. USITS 2001: 85-96 - 2000
- [j32]Ori Regev, Noam Nisan:
The POPCORN market. Online markets for computational resources. Decis. Support Syst. 28(1-2): 177-189 (2000) - [c44]Noam Nisan:
Bidding and allocation in combinatorial auctions. EC 2000: 1-12 - [c43]Ron Lavi, Noam Nisan:
Competitive analysis of incentive compatible on-line auctions. EC 2000: 233-241 - [c42]Noam Nisan, Amir Ronen:
Computationally feasible VCG mechanisms. EC 2000: 242-252
1990 – 1999
- 1999
- [j31]Ilan Kremer, Noam Nisan, Dana Ron:
On Randomized One-Round Communication Complexity. Comput. Complex. 8(1): 21-49 (1999) - [j30]Yishay Mansour, Noam Nisan, Uzi Vishkin:
Trade-offs between Communication Throughput and Parallel Time. J. Complex. 15(1): 148-166 (1999) - [j29]Noam Nisan, Amnon Ta-Shma:
Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. 58(1): 148-173 (1999) - [j28]David R. Karger, Noam Nisan, Michal Parnas:
Fast Connected Components Algorithms for the EREW PRAM. SIAM J. Comput. 28(3): 1021-1034 (1999) - [j27]Noam Nisan, Steven Rudich, Michael E. Saks:
Products and Help Bits in Decision Trees. SIAM J. Comput. 28(3): 1035-1050 (1999) - [c41]Noam Nisan:
Algorithms for Selfish Agents. STACS 1999: 1-15 - [c40]Noam Nisan, Amir Ronen:
Algorithmic Mechanism Design (Extended Abstract). STOC 1999: 129-140 - 1998
- [j26]Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson:
On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57(1): 37-49 (1998) - [j25]Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic:
Efficient approximation of product distributions. Random Struct. Algorithms 13(1): 1-16 (1998) - [c39]Noam Nisan, Shmulik London, Oded Regev, Noam Camiel:
Globally Distributed Computation over the Internet - The POPCORN Project. ICDCS 1998: 592-601 - [c38]Ori Regev, Noam Nisan:
The POPCORN market - an online market for computational resources. ICE 1998: 148-157 - [c37]Dorit Aharonov, Alexei Y. Kitaev, Noam Nisan:
Quantum Circuits with Mixed States. STOC 1998: 20-30 - 1997
- [b2]Eyal Kushilevitz, Noam Nisan:
Communication complexity. Cambridge University Press 1997, ISBN 978-0-521-56067-2, pp. I-XIII, 1-189 - [j24]Noam Nisan, Avi Wigderson:
Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Comput. Complex. 6(3): 217-234 (1997) - [c36]Noam Nisan, Ziv Bar-Yossef:
Pointer Jumping Requires Concurrent Read. STOC 1997: 549-558 - [i5]Noam Nisan, Ziv Bar-Yossef:
Pointer Jumping Requires Concurrent Read. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j23]Noam Nisan, David Zuckerman:
Randomness is Linear in Space. J. Comput. Syst. Sci. 52(1): 43-52 (1996) - [c35]Noam Nisan:
Extracting Randomness: How and Why A survey. CCC 1996: 44-58 - 1995
- [j22]Noam Nisan, Amnon Ta-Shma:
Symmetric Logspace is Closed Under Complement. Chic. J. Theor. Comput. Sci. 1995 (1995) - [j21]Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Comb. 15(4): 557-565 (1995) - [j20]Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan:
Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995) - [j19]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SIAM J. Discret. Math. 8(1): 76-92 (1995) - [c34]Noam Nisan, Avi Wigderson:
Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). FOCS 1995: 16-25 - [c33]Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson:
On data structures and asymmetric communication complexity. STOC 1995: 103-111 - [c32]Noam Nisan, Amnon Ta-Shma:
Symmetric logspace is closed under complement. STOC 1995: 140-146 - [c31]Ilan Kremer, Noam Nisan, Dana Ron:
On randomized one-round communication complexity. STOC 1995: 596-605 - [c30]Noam Nisan, Avi Wigderson:
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. STOC 1995: 723-732 - [i4]Oded Goldreich, Leonid A. Levin, Noam Nisan:
On Constructing 1-1 One-Way Functions. Electron. Colloquium Comput. Complex. TR95 (1995) - [i3]Oded Goldreich, Noam Nisan, Avi Wigderson:
On Yao's XOR-Lemma. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j18]Noam Nisan:
RL <= SC. Comput. Complex. 4: 1-11 (1994) - [j17]Noam Nisan, Mario Szegedy:
On the Degree of Boolean Functions as Real Polynomials. Comput. Complex. 4: 301-313 (1994) - [j16]Noam Nisan, Avi Wigderson:
Hardness vs Randomness. J. Comput. Syst. Sci. 49(2): 149-167 (1994) - [c29]Noam Nisan, Steven Rudich, Michael E. Saks:
Products and Help Bits in Decision Trees. FOCS 1994: 318-329 - [c28]Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. FOCS 1994: 831-836 - [c27]Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas:
Neighborhood Preserving Hashing and Approximate Queries. SODA 1994: 251-259 - [c26]Russell Impagliazzo, Noam Nisan, Avi Wigderson:
Pseudorandomness for network algorithms. STOC 1994: 356-364 - [c25]Yishay Mansour, Noam Nisan, Uzi Vishkin:
Trade-offs between communication throughput and parallel time. STOC 1994: 372-381 - [i2]Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Electron. Colloquium Comput. Complex. TR94 (1994) - [i1]Noam Nisan, Amnon Ta-Shma:
Symmetric Logspace is Closed Under Complement. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [j15]László Babai, Lance Fortnow, Noam Nisan, Avi Wigderson:
BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Comput. Complex. 3: 307-318 (1993) - [j14]David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir:
On Dice and Coins: Models of Computation for Random Generation. Inf. Comput. 104(2): 159-174 (1993) - [j13]Nathan Linial, Yishay Mansour, Noam Nisan:
Constant Depth Circuits, Fourier Transform, and Learnability. J. ACM 40(3): 607-620 (1993) - [j12]Richard M. Karp, Rajeev Motwani, Noam Nisan:
Probabilistic Analysis of Network Flow Algorithms. Math. Oper. Res. 18(1): 71-97 (1993) - [j11]Russell Impagliazzo, Noam Nisan:
The Effect of Random Restrictions on Formula Size. Random Struct. Algorithms 4(2): 121-134 (1993) - [j10]Noam Nisan, Avi Wigderson:
Rounds in Communication Complexity Revisited. SIAM J. Comput. 22(1): 211-219 (1993) - [j9]Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1): 121-133 (1993) - [j8]Noam Nisan:
On Read-Once vs. Multiple Access to Randomness in Logspace. Theor. Comput. Sci. 107(1): 135-144 (1993) - [c24]Noam Nisan, David Zuckerman:
More deterministic simulation in logspace. STOC 1993: 235-244 - [c23]Michael Luby, Noam Nisan:
A parallel approximation algorithm for positive linear programming. STOC 1993: 448-457 - 1992
- [b1]Noam Nisan:
Using hard problems to create pseudorandom generators. ACM Distinguished Dissertations, MIT Press 1992, ISBN 978-0-262-14051-5, pp. I-VI, 1-43 - [j7]Noam Nisan:
Pseudorandom generators for space-bounded computation. Comb. 12(4): 449-461 (1992) - [j6]Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan:
Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992) - [j5]László Babai, Noam Nisan, Mario Szegedy:
Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs. J. Comput. Syst. Sci. 45(2): 204-232 (1992) - [c22]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SCT 1992: 262-274 - [c21]Noam Nisan, Endre Szemerédi, Avi Wigderson:
Undirected Connectivity in O(log ^1.5 n) Space. FOCS 1992: 24-29 - [c20]David R. Karger, Noam Nisan, Michal Parnas:
Fast Connected Components Algorithms for the EREW PRAM. SPAA 1992: 373-381 - [c19]Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic:
Approximations of General Independent Distributions. STOC 1992: 10-16 - [c18]Noam Nisan, Mario Szegedy:
On the Degree of Boolean Functions as Real Polynomials. STOC 1992: 462-467 - [c17]Noam Nisan:
RL ⊆ SC. STOC 1992: 619-623 - 1991
- [j4]Noam Nisan:
Pseudorandom bits for constant depth circuits. Comb. 11(1): 63-70 (1991) - [j3]Noam Nisan:
CREW PRAMs and Decision Trees. SIAM J. Comput. 20(6): 999-1007 (1991) - [c16]László Babai, Noam Nisan:
BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. SCT 1991: 213-219 - [c15]Noam Nisan:
Lower Bounds for Non-Commutative Computation (Extended Abstract). STOC 1991: 410-418 - [c14]Noam Nisan, Avi Wigderson:
Rounds in Communication Complexity Revisited. STOC 1991: 419-429 - 1990
- [j2]Nathan Linial, Noam Nisan:
Approximate inclusion-exclusion. Comb. 10(4): 349-365 (1990) - [c13]Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. SCT 1990: 90 - [c12]Joan Feigenbaum, Sampath Kannan, Noam Nisan:
Lower Bounds on Random-Self-Reducibility. SCT 1990: 100-109 - [c11]Noam Nisan:
On Read-Once vs. Multiple Access to Randomness in Logspace. SCT 1990: 179-184 - [c10]Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan:
Algebraic Methods for Interactive Proof Systems. FOCS 1990: 2-10 - [c9]Noam Nisan:
Psuedorandom Generators for Space-Bounded Computation. STOC 1990: 204-212 - [c8]Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. STOC 1990: 235-243 - [c7]Nathan Linial, Noam Nisan:
Approximate Inclusion-Exclusion. STOC 1990: 260-270
1980 – 1989
- 1989
- [j1]Noam Nisan, Danny Soroker:
Parallel Algorithms for Zero-One Supply-Demand Problems. SIAM J. Discret. Math. 2(1): 108-125 (1989) - [c6]Noam Nisan, Avi Wigderson:
Hardness vs. Randomness - A Survey (abstract). SCT 1989: 54 - [c5]Nathan Linial, Yishay Mansour, Noam Nisan:
Constant Depth Circuits, Fourier Transform, and Learnability. FOCS 1989: 574-579 - [c4]David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir:
On Dice and Coins: Models of Computation for Random Generation. ICALP 1989: 319-340 - [c3]László Babai, Noam Nisan, Mario Szegedy:
Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract). STOC 1989: 1-11 - [c2]Noam Nisan:
CREW PRAMs and Decision Trees. STOC 1989: 327-335 - 1988
- [c1]Noam Nisan, Avi Wigderson:
Hardness vs. Randomness (Extended Abstract). FOCS 1988: 2-11
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).
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 20:26 CEST 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:
