Filters








61,112 Hits in 2.1 sec

Fair Division of a Graph

Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected  ...  subgraph of this graph.  ...  The authors are grateful to the organizers of the Dagstuhl Seminar 16232 "Fair Division" and Budapest Workshop on Future Directions in Computational Social Choice (supported by COST Action IC 1205).  ... 
doi:10.24963/ijcai.2017/20 dblp:conf/ijcai/BouveretCEIP17 fatcat:cp7dyz3eznd5dpf6lxso7kgkkm

Fair Division of a Graph [article]

Sylvain Bouveret and Katarína Cechlárová and Edith Elkind and Ayumi Igarashi and Dominik Peters
2017 arXiv   pre-print
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share must form a connected  ...  subgraph of this graph.  ...  However, neither paper considers any fairness constraints. Two very recent papers, like ours, combine graphs and fair division.  ... 
arXiv:1705.10239v2 fatcat:6jtqo2nqcjfrhdvu5yshzjk5oe

Fair Packing of Independent Sets [chapter]

Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač, Joachim Schauer
2020 Lecture Notes in Computer Science  
In this work we add a graph theoretical perspective to a classical problem of fairly allocating indivisible items to several agents.  ...  Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph.  ...  The work of this paper was done in the framework of a bilateral project between University of Graz and University of Primorska, financed by the OeAD  ... 
doi:10.1007/978-3-030-48966-3_12 fatcat:5kv7dpi4rrhv3hyvnquyijovai

Fair allocation of indivisible goods under conflict constraints [article]

Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač, Joachim Schauer
2021 arXiv   pre-print
We consider the fair allocation of indivisible items to several agents and add a graph theoretical perspective to this classical problem.  ...  Aiming at a fair allocation, our goal is the maximization of the lowest total profit of items allocated to any one of the agents.  ...  The work of this paper was done in the framework of two bilateral projects between University of Graz and University of Primorska, financed by the OeAD  ... 
arXiv:2003.11313v3 fatcat:buxu5z5klfc3lgqs26wfigqdwm

Fair Division of Mixed Divisible and Indivisible Goods

Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We study the problem of fair division when the resources contain both divisible and indivisible goods.  ...  In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct generalization of both EF and EF1 to the mixed goods setting.  ...  Finally the correctness of Theorem 5.3 is directly implied by Lemmas 5.5 and 5.7. Discussion This work is concerned with fair division of a mixture of divisible and indivsible goods.  ... 
doi:10.1609/aaai.v34i02.5548 fatcat:wf2hgv37wvh2hd7qpoicihpfum

Efficient Fair Division with Minimal Sharing [article]

Fedor Sandomirskiy, Erel Segal-Halevi
2022 arXiv   pre-print
If the objects cannot be shared, so that each of them must be entirely allocated to a single agent, then a fair division may not exist.  ...  We show that, for a generic instance of the problem (all instances except a zero-measure set of degenerate problems), a fair fractionally Pareto-optimal division with the smallest possible number of shared  ...  We are grateful to participants of De Aequa Divisione Workshop on Fair Division (LUISS, Rome, 2019), Workshop on Theoretical Aspects of Fairness (WTAF, Patras, 2019) and the rationality center game theory  ... 
arXiv:1908.01669v3 fatcat:xyul32nzfjcq3blnn7ag5n6uqu

Chore division on a graph

Sylvain Bouveret, Katarína Cechlárová, Julien Lesca
2019 Autonomous Agents and Multi-Agent Systems  
We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph.  ...  We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies.  ...  Several recent papers combine graphs and fair division of indivisible items by assuming that agents are located in the vertices of a graph.  ... 
doi:10.1007/s10458-019-09415-z fatcat:qgxgvgqakbd6xkebxhh7r6o4na

Chore division on a graph [article]

Sylvain Bouveret and Katarína Cechlárová and Julien Lesca
2018 arXiv   pre-print
We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph.  ...  We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies.  ...  Several recent papers combine graphs and fair division of indivisible items by assuming that agents are located in the vertices of a graph.  ... 
arXiv:1812.01856v1 fatcat:zry3vxzpcng3tjgntiwaog2ybu

Fair Division with a Secretive Agent

Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We study classic fair-division problems in a partial information setting. This paper respectively addresses fair division of rent, cake, and indivisible goods among agents with cardinal preferences.  ...  We will show that, for all of these settings and under appropriate valuations, a fair (or an approximately fair) division among n agents can be efficiently computed using only the valuations of n − 1 agents  ...  find a fair division among n agents.  ... 
doi:10.1609/aaai.v33i01.33011732 fatcat:6xf7mmt5q5ghxnov5twjmulw6m

An Efficient and Fair Solution for Communication Graph Games

René van den Brink, Anna B. Khmelnitskaya, Gerard van der Laan
2011 Social Science Research Network  
This yields a so-called (communication) graph game, given by a triple consisting of a finite set of players, a characteristic function and a communication graph.  ...  of the empty graph), component merging (meaning that merging the components' players into a single player does not affect the total payoff to the component) and a modified version of Myerson's fairness  ... 
doi:10.2139/ssrn.1785246 fatcat:dpgalexhavav7itju3ysh4lcom

An efficient and fair solution for communication graph games

René van den Brink, Anna Khmelnitskaya, Gerard van der Laan
2012 Economics Letters  
This yields a so-called (communication) graph game, given by a triple consisting of a finite set of players, a characteristic function and a communication graph.  ...  of the empty graph), component merging (meaning that merging the components' players into a single player does not affect the total payoff to the component) and a modified version of Myerson's fairness  ... 
doi:10.1016/j.econlet.2012.08.026 fatcat:lfuehpbwg5avllvsymcowhxlvy

Fair Division Under Cardinality Constraints

Arpita Biswas, Siddharth Barman
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
This problem naturally captures a number of resource-allocation applications, and is a generalization of the well-studied unconstrained fair division problem.  ...  The two central notions of fairness, in the context of fair division of indivisible goods, are envy freeness up to one good (EF1) and the (approximate) maximin share guarantee (MMS).  ...  Acknowledgments Siddharth Barman was supported by a Ramanujan Fellowship (SERB -SB/S2/RJN-128/2015). Arpita Biswas gratefully acknowledges the support of a Google PhD Fellowship Award.  ... 
doi:10.24963/ijcai.2018/13 dblp:conf/ijcai/BiswasB18 fatcat:d35xypgvorbr7ba7qxqtdilzce

Fair Division of Mixed Divisible and Indivisible Goods [article]

Xiaohui Bei, Zihao Li, Jinyan Liu, Shengxin Liu, Xinhang Lu
2020 arXiv   pre-print
We study the problem of fair division when the resources contain both divisible and indivisible goods.  ...  In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct generalization of both EF and EF1 to the mixed goods setting.  ...  In the cake-adding phase, if the piece of cake to be allocated is not the whole remaining cake, the sum of all agents' valuation on the remaining cake decreases by at leastǫ. Proof.  ... 
arXiv:1911.07048v2 fatcat:fxerxkqoovbdbiweo3c4yg7h7e

Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division [article]

Elad Aigner-Horev, Erel Segal-Halevi
2021 arXiv   pre-print
We show how envy-free matchings can be used in various fair division problems with either continuous resources ("cakes") or discrete ones.  ...  For edge-weighted bipartite graphs, we provide a polynomial-time algorithm for finding a maximum-cardinality envy-free matching of minimum total weight.  ...  of fair division problems.  ... 
arXiv:1901.09527v5 fatcat:v5kaknb56rcs7dafstho36azte

One Dollar Each Eliminates Envy [article]

Johannes Brustle and Jack Dippel and Vishnu V. Narayan and Mashbat Suzuki and Adrian Vetta
2019 arXiv   pre-print
We study the fair division of a collection of m indivisible goods amongst a set of n agents.  ...  Whilst envy-free allocations typically do not exist in the indivisible goods setting, envy-freeness can be achieved if some amount of a divisible good (money) is introduced.  ...  Bidding for envy-freeness: A procedural approach to n-player fair-division problems. Social Choice and Welfare, 19(4):723–749, 2002. [11] D. Halpern and N. Shah. Fair division with subsidy.  ... 
arXiv:1912.02797v1 fatcat:orvzknnjtnec3n23nsvu77lqra
« Previous Showing results 1 — 15 out of 61,112 results