IDEAS home Printed from https://ideas.repec.org/f/pni254.html
   My authors  Follow this author

Noam Nisan

Personal Details

First Name:Noam
Middle Name:
Last Name:Nisan
Suffix:
RePEc Short-ID:pni254
[This author has chosen not to make the email address public]
http://www.cs.huji.ac.il/~noam
Terminal Degree:1988 Department of Economics; University of California-Berkeley (from RePEc Genealogy)

Affiliation

Center for the Study of Rationality
Hebrew University of Jerusalem

Jerusalem, Israel
http://www.ratio.huji.ac.il/
RePEc:edi:crihuil (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Yannai A. Gonczarowski & Lior Kovalio & Noam Nisan & Assaf Romm, 2019. "Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements," Papers 1905.00364, arXiv.org, revised Aug 2020.
  2. Sergiu Hart & Noam Nisan, 2014. "How Good Are Simple Mechanisms for Selling Multiple Goods?," Discussion Paper Series dp666, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  3. Gali Noti & Noam Nisan & Ilan Yaniv, 2014. "An experimental evaluation of bidders' behavior in ad auctions," Discussion Paper Series dp676, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  4. Yannai A. Gonczarowski & Noam Nisan, 2014. "A Stable Marriage Requires Communication," Discussion Paper Series dp667, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  5. Sergiu Hart & Noam Nisan, 2013. "The Query Complexity of Correlated Equilibria," Levine's Working Paper Archive 786969000000000819, David K. Levine.
  6. Sergiu Hart & Noam Nisan, 2013. "The Menu-Size Complexity of Auctions," Discussion Paper Series dp637, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  7. Sergiu Hart & Noam Nisan, 2012. "Approximate Revenue Maximization with Multiple Items," Discussion Paper Series dp606, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  8. Ehud Friedgut & Gil Kalai & Noam Nisan, 2008. "Elections Can be Manipulated Often," Levine's Working Paper Archive 122247000000002416, David K. Levine.
  9. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  10. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  11. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

Articles

  1. Hart, Sergiu & Nisan, Noam, 2019. "Selling multiple correlated goods: Revenue maximization and menu-size complexity," Journal of Economic Theory, Elsevier, vol. 183(C), pages 991-1029.
  2. Gonczarowski, Yannai A. & Nisan, Noam & Ostrovsky, Rafail & Rosenbaum, Will, 2019. "A stable marriage requires communication," Games and Economic Behavior, Elsevier, vol. 118(C), pages 626-647.
  3. Dobzinski, Shahar & Nisan, Noam & Oren, Sigal, 2019. "Economic efficiency requires interaction," Games and Economic Behavior, Elsevier, vol. 118(C), pages 589-608.
  4. Hart, Sergiu & Nisan, Noam, 2018. "The query complexity of correlated equilibria," Games and Economic Behavior, Elsevier, vol. 108(C), pages 401-410.
  5. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
  6. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
  7. Lavi, Ron & Nisan, Noam, 2015. "Online ascending auctions for gradually expiring items," Journal of Economic Theory, Elsevier, vol. 156(C), pages 45-76.
  8. Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
  9. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
  10. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
  11. Ron Lavi & Ahuva Mu’alem & Noam Nisan, 2009. "Two simplified proofs for Roberts’ theorem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(3), pages 407-423, March.
  12. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.
  13. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.
  14. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
  15. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
  16. Sushil Bikhchandani & Shurojit Chatterji & Ron Lavi & Ahuva Mu'alem & Noam Nisan & Arunava Sen, 2006. "Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation," Econometrica, Econometric Society, vol. 74(4), pages 1109-1132, July.
  17. Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
    RePEc:inm:ormoor:v:35:y:2010:i:1:p:1-13 is not listed on IDEAS
    RePEc:inm:ormoor:v:18:y:1993:i:1:p:71-97 is not listed on IDEAS

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Rankings

This author is among the top 5% authors according to these criteria:
  1. Number of Journal Pages, Weighted by Recursive Impact Factor

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 13 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-MIC: Microeconomics (6) 2012-04-23 2012-05-15 2013-06-09 2013-10-02 2013-10-11 2014-08-20. Author is listed
  2. NEP-CDM: Collective Decision-Making (2) 2008-04-21 2008-10-21
  3. NEP-CMP: Computational Economics (2) 2005-07-03 2005-07-03
  4. NEP-GTH: Game Theory (2) 2005-12-01 2013-10-11
  5. NEP-POL: Positive Political Economics (2) 2008-04-21 2008-10-21
  6. NEP-CTA: Contract Theory and Applications (1) 2013-06-09
  7. NEP-DCM: Discrete Choice Models (1) 2019-05-06
  8. NEP-DES: Economic Design (1) 2019-05-06
  9. NEP-EXP: Experimental Economics (1) 2015-02-05
  10. NEP-HPE: History and Philosophy of Economics (1) 2013-10-11

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Noam Nisan should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.