Result 1 to 11 of 11 total
A general elicitation-free protocol for allocating indivisible goods (English)
IJCAI, 73-78 (2011).
1
Towards a categorical framework to ensure correct software evolutions (English)
ICDE Workshops, 139-144 (2011).
2
Fair division under ordinal preferences: computing envy-free allocations of indivisible goods. (English)
Coelho, Helder (ed.) et al., ECAI 2010. 19th European conference on artificial intelligence, August 16‒20, 2010 Lisbon, Portugal. Including proceedings of the 6th prestigious applications of artificial intelligence (PAIS-2010). Amsterdam: IOS Press (ISBN 978-1-60750-605-8/pbk; 978-1-60750-606-5/ebook). Frontiers in Artificial Intelligence and Applications 215, 387-392 (2010).
3
Fair division under ordinal preferences: computing envy-free allocations of indivisible goods (English)
ECAI, 387-392 (2010).
4
Computing leximin-optimal solutions in constraint networks. (English)
Artif. Intell. 173, No. 2, 343-364 (2009).
5
Conditional importance networks: A graphical language for representing ordinal, monotonic preferences over sets of goods (English)
IJCAI, 67-72 (2009).
6
On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences (English)
ADT, 98-110 (2009).
7
Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. (English)
J. Artif. Intell. Res. (JAIR) 32, 525-564 (2008).
8
New constraint programming approaches for the computation of leximin-optimal solutions in constraint networks (English)
IJCAI, 62-67 (2007).
9
Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity (English)
IJCAI, 935-940 (2005).
10
Allocation of indivisible goods: a general model and some complexity results (English)
AAMAS, 1309-1310 (2005).
11
Result 1 to 11 of 11 total
Start
Contact
Print
General Help
