English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Fair and Efficient Allocation of Indivisible Chores with Surplus

Akrami, H., Ray Chaudhury, B., Garg, J., Mehlhorn, K., & Mehta, R. (2023). Fair and Efficient Allocation of Indivisible Chores with Surplus. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (pp. 2494-2502). IJCAI. doi:10.24963/ijcai.2023/277.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-000F-1425-1 Version Permalink: https://hdl.handle.net/21.11116/0000-000F-1426-0
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://www.ijcai.org/proceedings/2023/277 (Publisher version)
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Akrami, Hannaneh1, Author           
Ray Chaudhury, Bhaskar2, Author           
Garg, Jugal2, Author           
Mehlhorn, Kurt1, Author                 
Mehta, Ruta2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20232023
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Akrami_IJCAI2023b
DOI: 10.24963/ijcai.2023/277
 Degree: -

Event

show
hide
Title: Thirty-Second International Joint Conference on Artificial Intelligence
Place of Event: Macao
Start-/End Date: 2023-08-19 - 2023-08-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence
  Abbreviation : IJCAI 2023
Source Genre: Proceedings
 Creator(s):
Elkind, Edith1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: IJCAI
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 2494 - 2502 Identifier: ISBN: 978-1-956792-03-4