A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
2008
The Journal of Artificial Intelligence Research
Preserved Fulltext
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. ...
We express efficiency and envy-freeness in a logical setting, which reveals unexpected connections to nonmonotonic reasoning. ...
Acknowledgements: We thank Michel Lemaître for stimulating discussions about fair division and compact representation, and Thibault Gajdos for stimulating discussions about envy-freeness and for pointing ...
doi:10.1613/jair.2467
fatcat:oci5j6yeqvhr7hoogvc7rdqigq
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
2015
Autonomous Agents and Multi-Agent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. ...
We analyze the computational properties of the five criteria, give some experimental results about them, and further investigate a slightly richer model with k-additive preferences. ...
Acknowledgements We thank Ariel Procaccia and members of COST Action IC-1205 for helpful discussions. ...
doi:10.1007/s10458-015-9287-3
fatcat:bclgskdoaba5jbvjgo42trrhp4
Fair Division: The Computer Scientist's Perspective
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. ...
This has involved bringing to bear tools such as those used in knowledge representation, computational complexity, approximation methods, game theory, online analysis and communication complexity ...
This has proved popular in fair division, starting with the work of Lipton et al. [2004] and an attractive relaxation of envy-freeness: envy-freeness up to one good (EF1). ...
arXiv:2005.04855v1
fatcat:syhptgav6rh7bcgaguxcriehxu
Variable Elimination in Binary CSPs (Extended Abstract)
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose new rules and compare them, both theoretically and experimentally. We give optimised algorithms to apply these rules and show that each defines a novel tractable class. ...
Using our variable-elimination rules in preprocessing allowed us to solve more benchmark problems than without. ...
This has proved popular in fair division, starting with the work of Lipton et al. [2004] and an attractive relaxation of envy-freeness: envy-freeness up to one good (EF1). ...
doi:10.24963/ijcai.2020/691
dblp:conf/ijcai/Walsh20
fatcat:i4h3p6o2tvcl7iu4ah33hk2nr4
Dividing Goods or Bads Under Additive Utilities
2016
Social Science Research Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Beyond the fair division of private goods, RM has been applied to a broad range of resource allocation problems with production and/or indivisibilities. 5 Fair Share Guarantee (FSG) says that nobody ...
In particular at most one agent is eating both goods, and we have two types of efficient and envy-free allocations. ...
Recall that F c (Q) is the set of critical points of the Nash product in Ψ ef f (Q).The k/k + 1-cut allocations are the extreme points of the set of feasible allocations Φ (N, A) , and their utility profiles ...
doi:10.2139/ssrn.2826474
fatcat:cvpjd36mqba45pe2ph4o6y2b2q
Multiagent resource allocation
2006
Knowledge engineering review (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Resource allocation in multiagent systems is a central research issue in the AgentLink community. ...
In the first talk of the session, S. Bouveret interpreted the concept of fairness in the sense of envy freeness. ...
Of particular importance are concepts such as envy freeness and equatability that can be used to model fairness. ...
doi:10.1017/s0269888905000470
fatcat:jbkkq2wt4zdcjnulkstae3itdu
Some Representation and Computational Issues in Social Choice
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
The starting point is that many AI topics, especially those related to the EC-SQARU and KR conferences, can bring a lot to the representation and the resolution of social choice problems. ...
This paper briefly considers several research issues, some of which are on-going and some others are for further research. ...
relate the search of envy-freeness and efficient allocations to some well-known problems in knowledge representation. ...
doi:10.1007/11518655_3
fatcat:7yk4ziiuajg2hafakyqhq64xsi
A Short Introduction to Computational Social Choice
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
procedures or fair division algorithms. ...
Computational social choice is an interdisciplinary field of study at the interface of social choice theory and computer science, promoting an exchange of ideas in both directions. ...
A Condorcet-consistent rule is a voting rule electing the Condorcet winner whenever there is one. resource allocation and fair division -Resource allocation of indivisible goods aims at assigning items ...
doi:10.1007/978-3-540-69507-3_4
fatcat:lajqmwaqhfe7fmx2vxwnarpyce
Preference Handling in Combinatorial Domains: From AI to Social Choice
2008
The AI Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
After giving an overview of languages for compact representation of preferences, we discuss problems in voting in combinatorial domains, and then focus on multiagent resource allocation and fair division ...
We give an introduction to preference handling in combinatorial domains in the context of collective decision making, and show that the considerable body of work on preference representation and elicitation ...
The work of the other three authors has been partially supported by the French ANR project "Preference Handling and Aggregation in Combinatorial Domains". ...
doi:10.1609/aimag.v29i4.2201
fatcat:csbkqo4bx5ec5ntcmaywnrzzzy
Fair in the Eyes of Others
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Envy-freeness is a widely studied notion in resource allocation, capturing some aspects of fairness. ...
) we provide a general method based on a mixed integer programming encoding of the problem, which proves to be efficient in practice. ...
Envy-freeness (EF), is one of the prominent notions studied in fair division [13, 6, 18, 11, 26 ]. ...
arXiv:1911.11053v1
fatcat:wbgp3rt7qfdnrkhzoak4hnmlku
Fair Division: The Computer Scientist's Perspective
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. ...
This has involved bringing to bear tools such as those used in knowledge representation, computational complexity, approximation methods, game theory, online analysis and communication complexity. ...
Acknowledgements This work was funded in part by the French government under management of Agence Nationale de la Recherche as part of the "Investissements d'avenir" program ANR-19-P3IA-0001 (PRAIRIE 3IA ...
doi:10.24963/ijcai.2020/680
dblp:conf/ijcai/Lang20
fatcat:ax6vwxbljreffh5tfjromvi52m
Fair Public Decision Making
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We generalize the classic problem of fairly allocating indivisible goods to the problem of fair public decision making, in which a decision must be made on several social issues simultaneously, and, unlike ...
share, and pessimistic proportional share --- that are also interesting in the classic goods allocation setting. ...
Acknowledgements Conitzer and Freeman are supported by NSF under awards IIS-1527434 and CCF-1337215, ARO under grants W911NF-12-1-0550 and W911NF-11-1-0332, and a Guggenheim Fellowship. ...
arXiv:1611.04034v2
fatcat:fyhfo6jkhfbopjizijytqolrmm
Fair Allocation of Indivisible Goods
[chapter]
Handbook of Computational Social Choice
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
What mainly makes fair division of indivisible goods specific, if not more difficult, is that classical fairness concepts like envy-freeness or proportionality are sometimes unreachable, unlike in the ...
In this chapter, we will focus on fair division of indivisible goods. In other words, the resource is here a set O = {o 1 , . . . , o p } of objects (that may also be called goods or items). ...
Acknowledgements We would like to thank our editors (in particular Ulle Endriss, Jérôme Lang, and Ariel Procaccia) and our reviewers, Haris Aziz and Stéphane Airiau, for their support, corrections, and ...
doi:10.1017/cbo9781107446984.013
fatcat:elnwmkxgs5g4hcupqojwbye2mi
Graphical One-Sided Markets
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We then identify structural restrictions where stable allocations always exist and can be computed efficiently. Finally, we study the notion of envy-freeness in this framework. ...
We consider the solution concept of stability and show that, unlike in the case of one-sided markets, stable allocations may not always exist. ...
Effi-
ciency and envy-freeness in fair division of indivisible
goods: Logical representation and complexity. JAIR,
32:525-564, 2008.
[Bouveret et al., 2016] S. Bouveret, Y. Chevaleyre, and
N. ...
arXiv:1911.06757v1
fatcat:ynmmvmxvcjauthdahqg472hf5m
Computational Social Choice: The First Ten Years and Beyond
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Typical applications include voting, resource allocation, and fair division. ...
Computational social choice is a research area at the intersection of computer science, mathematics, and economics that is concerned with aggregation of preferences of multiple agents. ...
Typical applications include voting, resource allocation, and fair division. ...
doi:10.1007/978-3-319-91908-9_4
fatcat:u5nezniajbe53lwvb6u3e3rfwy
« Previous
Showing results 1 — 15 out of 45 results