default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 116 matches
- 2024
- Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu, Xinran Zhu:
Almost proportional allocations of indivisible chores: Computation, approximation and efficiency. Artif. Intell. 331: 104118 (2024) - Shengwei Zhou, Xiaowei Wu:
Approximately EFX allocations for indivisible chores. Artif. Intell. 326: 104037 (2024) - Simina Brânzei, Fedor Sandomirskiy:
Algorithms for Competitive Division of Chores. Math. Oper. Res. 49(1): 398-429 (2024) - Haris Aziz, Bo Li, Xiaowei Wu:
Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Math. Program. 203(1): 319-345 (2024) - Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino:
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002: 114596 (2024) - Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. AAAI 2024: 9901-9908 - Zhe Liu, Wenguo Yang, Suixiang Gao:
Finding Fair and Efficient Allocations of Indivisible Chores. AAIM (2) 2024: 233-242 - Vishwa Prakash HV, Prajakta Nimbhorkar:
Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings. AAMAS 2024: 780-788 - Hadi Hosseini, Joshua Kavner, Tomasz Was, Lirong Xia:
Distribution of Chores with Information Asymmetry. AAMAS 2024: 2306-2308 - Yatharth Kumar, Sarfaraz Equbal, Rohit Gurjar, Swaprava Nath, Rohit Vaish:
Fair Scheduling of Indivisible Chores. AAMAS 2024: 2345-2347 - Ankang Sun, Bo Li:
Allocating Contiguous Blocks of Indivisible Chores Fairly: Revisited. AAMAS 2024: 1800-1808 - Fangxiao Wang, Bo Li, Pinyan Lu:
Improved Approximation of Weighted MMS Fairness for Indivisible Chores. IJCAI 2024: 3014-3022 - Yu Zhou, Tianze Wei, Minming Li, Bo Li:
A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna. IJCAI 2024: 3049-3056 - Vasilis Christoforidis, Christodoulos Santorinaios:
On the Pursuit of EFX for Chores: Non-existence and Approximations. IJCAI 2024: 2713-2721 - Jugal Garg, Aniket Murhekar, John Qin:
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. IJCAI 2024: 2799-2806 - Edith Elkind, Ayumi Igarashi, Nicholas Teh:
Fair Division of Chores with Budget Constraints. SAGT 2024: 55-71 - Stephen Saunders, Alvaro Uribe-Quevedo, Winnie Sun, Sheri Horsburgh:
Asymmetric VR Chores: A Social Presence Preliminary Study. VR Workshops 2024: 819-820 - Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar, Swaprava Nath, Rohit Vaish:
Fair Interval Scheduling of Indivisible Chores. CoRR abs/2402.04353 (2024) - Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta, Tianlong Nan:
Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm. CoRR abs/2402.10439 (2024) - Owen Eckart, Alexandros Psomas, Paritosh Verma:
On the Fairness of Normalized p-Means for Allocating Goods and Chores. CoRR abs/2402.14996 (2024) - Jugal Garg, Aniket Murhekar, John Qin:
Weighted EF1 and PO Allocations with Few Types of Agents or Chores. CoRR abs/2402.17173 (2024) - Vasilis Christoforidis, Christodoulos Santorinaios:
On The Pursuit of EFX for Chores: Non-Existence and Approximations. CoRR abs/2406.10752 (2024) - Jugal Garg, Aniket Murhekar, John Qin:
Fair Division of Indivisible Chores via Earning Restricted Equilibria. CoRR abs/2407.03318 (2024) - 2023
- Ankang Sun, Bo Chen, Xuan Vinh Doan:
Fairness criteria for allocating indivisible chores: connections and efficiencies. Auton. Agents Multi Agent Syst. 37(2): 39 (2023) - Jugal Garg, Peter McGlaughlin, Martin Hoefer, Marco Schmalhofer:
Competitive Equilibria with a Constant Number of Chores. J. Artif. Intell. Res. 78: 1201-1219 (2023) - Haris Aziz, Jeremy Lindsay, Angus Ritossa, Mashbat Suzuki:
Fair Allocation of Two Types of Chores. AAMAS 2023: 143-151 - Hadi Hosseini, Sujoy Sikdar, Rohit Vaish, Lirong Xia:
Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences. AAMAS 2023: 152-160 - Mingyu Xiao, Guoliang Qiu, Sen Huang:
MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. AAMAS 2023: 2886-2888 - Huahua Miao, Sijia Dai, Yicheng Xu, Yong Zhang:
EFX Allocation to Chores over Small Graph. COCOA (2) 2023: 279-291 - Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta:
Fair and Efficient Allocation of Indivisible Chores with Surplus. IJCAI 2023: 2494-2502
skipping 86 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-21 17:57 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint