Finding middle grounds for incoherent horn expressions: the moral machine case (bibtex)
by Ozaki, Ana, Rehman, Anum and Slavkovik, Marija
Abstract:
Smart devices that operate in a shared environment with people need to be aligned with their values and requirements. We study the problem of multiple stakeholders informing the same device on what the right thing to do is. Specifically, we focus on how to reach a middle ground among the stakeholders inevitably incoherent judgments on what the rules of conduct for the device should be. We formally define a notion of middle ground and discuss the main properties of this notion. Then, we identify three sufficient conditions on the class of Horn expressions for which middle grounds are guaranteed to exist. We provide a polynomial time algorithm that computes middle grounds, under these conditions. We also show that if any of the three conditions is removed then middle grounds for the resulting (larger) class may not exist. Finally, we implement our algorithm and perform experiments using data from the Moral Machine Experiment. We present conflicting rules for different countries and how the algorithm finds the middle ground in this case.
Reference:
Finding middle grounds for incoherent horn expressions: the moral machine case (Ozaki, Ana, Rehman, Anum and Slavkovik, Marija), In Autonomous Agents and Multi-Agent Systems, volume 38, 2024.
Bibtex Entry:
@article{ozaki_finding_2024,
	title = {Finding middle grounds for incoherent horn expressions: the moral machine case},
	volume = {38},
	issn = {1573-7454},
	url = {https://doi.org/10.1007/s10458-024-09681-6},
	doi = {10.1007/s10458-024-09681-6},
	abstract = {Smart devices that operate in a shared environment with people need to be aligned with their values and requirements. We study the problem of multiple stakeholders informing the same device on what the right thing to do is. Specifically, we focus on how to reach a middle ground among the stakeholders inevitably incoherent judgments on what the rules of conduct for the device should be. We formally define a notion of middle ground and discuss the main properties of this notion. Then, we identify three sufficient conditions on the class of Horn expressions for which middle grounds are guaranteed to exist. We provide a polynomial time algorithm that computes middle grounds, under these conditions. We also show that if any of the three conditions is removed then middle grounds for the resulting (larger) class may not exist. Finally, we implement our algorithm and perform experiments using data from the Moral Machine Experiment. We present conflicting rules for different countries and how the algorithm finds the middle ground in this case.},
	number = {2},
	journal = {Autonomous Agents and Multi-Agent Systems},
	author = {Ozaki, Ana and Rehman, Anum and Slavkovik, Marija},
	month = oct,
	year = {2024},
	pages = {50},
}
Powered by bibtexbrowser