default search action
Yohai Trabelsi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Abhijin Adiga, Yohai Trabelsi, Tanvir Ferdousi, Madhav V. Marathe, S. S. Ravi, Samarth Swarup, Anil Kumar S. Vullikanti, Mandy L. Wilson, Sarit Kraus, Reetwika Basu, Supriya Savalkar, Matthew Yourek, Michael Brady, Kirti Rajagopalan, Jonathan Yoder:
Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading. AAMAS 2024: 13-21 - [c10]Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon:
The Complexity of Manipulation of k-Coalitional Games on Graphs. ECAI 2024: 3388-3396 - [c9]Yohai Trabelsi, Pan Xu, Sarit Kraus:
Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option. IJCAI 2024: 257-264 - [c8]Yohai Trabelsi:
Fairness and Optimization in Dynamic Multiagent Allocation Problems. IJCAI 2024: 8516-8517 - [i6]Abhijin Adiga, Yohai Trabelsi, Tanvir Ferdousi, Madhav V. Marathe, S. S. Ravi, Samarth Swarup, Anil Kumar S. Vullikanti, Mandy L. Wilson, Sarit Kraus, Reetwika Basu, Supriya Savalkar
, Matthew Yourek, Michael Brady, Kirti Rajagopalan, Jonathan Yoder:
Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading. CoRR abs/2402.06576 (2024) - [i5]Yohai Trabelsi, Pan Xu, Sarit Kraus:
Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option. CoRR abs/2407.00032 (2024) - [i4]Hodaya Barr, Yohai Trabelsi, Sarit Kraus, Liam Roditty, Noam Hazon:
The Complexity of Manipulation of k-Coalitional Games on Graphs. CoRR abs/2408.07368 (2024) - 2023
- [c7]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi, Daniel J. Rosenkrantz:
Resource Sharing through Multi-Round Matchings. AAAI 2023: 11681-11690 - [c6]Osnat Ackerman Viden, Yohai Trabelsi, Pan Xu, Karthik Abinav Sankararaman, Oleg Maksimov, Sarit Kraus:
Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments. AAMAS 2023: 513-521 - [c5]Yohai Trabelsi:
Bipartite Matching for Repeated Allocation Problems. AAMAS 2023: 2928-2930 - [c4]Yohai Trabelsi
Advice Provision in Teleoperation of Autonomous Vehicles. IUI 2023: 750-761 - 2022
- [c3]Yohai Trabelsi
Maximizing Resource Allocation Likelihood with Minimum Compromise. AAMAS 2022: 1738-1740 - [c2]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi:
Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise. EUMAS 2022: 403-420 - [i3]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi:
Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise. CoRR abs/2209.05170 (2022) - [i2]Yohai Trabelsi, Abhijin Adiga, Sarit Kraus, S. S. Ravi, Daniel J. Rosenkrantz:
Resource Sharing Through Multi-Round Matchings. CoRR abs/2211.17199 (2022)
2010 – 2019
- 2014
- [j1]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck non-crossing matching in the plane. Comput. Geom. 47(3): 447-457 (2014) - 2012
- [c1]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-crossing Matching in the Plane. ESA 2012: 36-47 - [i1]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck Non-Crossing Matching in the Plane. CoRR abs/1202.4146 (2012)
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-10-28 20:15 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: