default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAssaf Romm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Assaf Romm, Alvin E. Roth, Ran I. Shorrer:
Stability vs. no justified envy. Games Econ. Behav. 148: 357-366 (2024)- 2021
- [j7]Avinatan Hassidim, Assaf Romm, Ran I. Shorrer
:
The Limits of Incentives in Economic Matching Procedures. Manag. Sci. 67(2): 951-963 (2021) - [j6]Yannai A. Gonczarowski, Assaf Romm, Ran I. Shorrer:
Market design job market candidate profiles 2022. SIGecom Exch. 19(2): 32-36 (2021) - 2019
- [j5]Itai Ashlagi, Afshin Nikzad, Assaf Romm:
Assigning more students to their top choices: A comparison of tie-breaking rules. Games Econ. Behav. 115: 167-187 (2019) - 2018
- [j4]Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm:
Redesigning the Israeli Medical Internship Match. ACM Trans. Economics and Comput. 6(3-4): 21:1-21:18 (2018) - 2015
- [j3]Mira Frick, Assaf Romm:
Rational behavior under correlated uncertainty. J. Econ. Theory 160: 56-71 (2015) - 2014
- [j2]Assaf Romm:
Implications of capacity reduction and entry in many-to-one stable matching. Soc. Choice Welf. 43(4): 851-875 (2014) - 2011
- [j1]Assaf Romm:
Solution to Exchanges 8.2 puzzle: a Dutch Dutch auction clock auction. SIGecom Exch. 10(1): 40-44 (2011)
Conference and Workshop Papers
- 2022
- [c8]Péter Biró, Avinatan Hassidim, Assaf Romm, Ran I. Shorrer, Sándor Sovago:
The Large Core of College Admission Markets: Theory and Evidence. EC 2022: 958-959 - 2019
- [c7]Yannai A. Gonczarowski, Noam Nisan, Lior Kovalio, Assaf Romm:
Matching for the Israeli: Handling Rich Diversity Requirements. EC 2019: 321 - [c6]Moshe Babaioff, Yannai A. Gonczarowski, Assaf Romm:
Playing on a Level Field: Sincere and Sophisticated Players in the Boston Mechanism with a Coarse Priority Structure. EC 2019: 345 - 2017
- [c5]Avinatan Hassidim, Assaf Romm, Ran I. Shorrer:
Redesigning the Israeli Psychology Master's Match. EC 2017: 121-122 - 2016
- [c4]Avinatan Hassidim, Assaf Romm, Ran I. Shorrer:
"Strategic" Behavior in a Strategy-proof Environment. EC 2016: 763-764 - 2015
- [c3]Assaf Romm, Avinatan Hassidim:
An Approximate Law of One Price in Random Assignment Games. EC 2015: 279-280 - [c2]Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm:
Redesigning the Israeli Medical Internship Match. EC 2015: 753-754 - [c1]Itai Ashlagi, Afshin Nikzad, Assaf Romm:
Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison. EC 2015: 755-756
Informal and Other Publications
- 2019
- [i3]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) - 2018
- [i2]Moshe Babaioff, Yannai A. Gonczarowski, Assaf Romm:
Playing on a Level Field: Sincere and Sophisticated Players in the Boston Mechanism with a Coarse Priority Structure. CoRR abs/1810.06229 (2018) - 2014
- [i1]Avinatan Hassidim, Assaf Romm:
An Approximate "Law of One Price" in Random Assignment Games. CoRR abs/1404.6103 (2014)
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-11-11 22:25 CET 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:
