More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
SIAM Journal on Computing
Computationally Manageable Combinational Auctions
Management Science
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Communication complexity of common voting rules
Proceedings of the 6th ACM conference on Electronic commerce
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions
The complexity of contract negotiation
Artificial Intelligence
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Allocating goods on a graph to eliminate envy
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Extremal behaviour in multiagent contract negotiation
Journal of Artificial Intelligence Research
Negotiating socially optimal allocations of resources
Journal of Artificial Intelligence Research
Reaching envy-free states in distributed negotiation settings
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Bidding languages for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
On Low-Envy Truthful Allocations
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
A general branch-and-bound algorithm for fair division problems
Computers and Operations Research
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
dl2asp: implementing default logic via answer set programming
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Preferences in AI: An overview
Artificial Intelligence
A simple metric for turn-taking in emergent communication
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Optimal partitions in additively separable hedonic games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Computing desirable partitions in additively separable hedonic games
Artificial Intelligence
Reduction of economic inequality in combinatorial domains
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Maximal recursive rule: a new social decision scheme
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A matroid approach to the worst case allocation of indivisible goods
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
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 start by assuming that agents have dichotomous preferences expressed by propositional formulae. We express efficiency and envy-freeness in a logical setting, which reveals unexpected connections to nonmonotonic reasoning. Then we identify the complexity of determining whether there exists an efficient and envy-free allocation, for several notions of efficiency, when preferences are represented in a succinct way (as well as restrictions of this problem). We first study the problem under the assumption that preferences are dichotomous, and then in the general case.