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
[c122]Moshe Babaioff
, Amitai Frey, Noam Nisan:
Learning to Maximize Gains From Trade in Small Markets. EC 2024: 195- [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,