default search action
Hadi Yami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. AAAI 2024: 9901-9908 - 2023
- [i4]MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. CoRR abs/2305.16081 (2023) - 2022
- [j3]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin
, Saeed Seddighin, Hadi Yami:
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303: 103633 (2022) - 2021
- [j2]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46(3): 1038-1053 (2021) - [c7]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. AAAI 2021: 5355-5362 - 2020
- [b1]Hadi Yami:
Fairness Guarantees in Allocation Problems. University of Maryland, College Park, MD, USA, 2020 - [i3]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR abs/2007.07027 (2020)
2010 – 2019
- 2019
- [j1]Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - [c6]MohammadAmin Ghiasi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, Hadi Yami:
On the Efficiency and Equilibria of Rich Ads. IJCAI 2019: 301-307 - 2018
- [c5]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin
Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC 2018: 539-556 - [c4]Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami:
Envy-free Chore Division for An Arbitrary Number of Agents. SODA 2018: 2564-2583 - 2017
- [c3]Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Hadi Yami:
Market Pricing for Data Streams. AAAI 2017: 291-297 - [c2]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS 2017: 1535-1537 - [c1]Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami:
Brief Announcement: Graph Matching in Massive Datasets. SPAA 2017: 133-136 - [i2]Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR abs/1703.01649 (2017) - [i1]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement and Generalization. CoRR abs/1704.00222 (2017)
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-05-08 20:57 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: