Peter Stone's Selected Publications

Classified by TopicClassified by Publication TypeSorted by DateSorted by First Author Last NameClassified by Funding Source


Sequential Online Chore Division for Autonomous Vehicle Convoy Formation

Harel Yedidsion, Shani Alkoby, and Peter Stone. Sequential Online Chore Division for Autonomous Vehicle Convoy Formation. Technical Report arXiv e-Prints 2104.04159, arXiv, 2021.
arXiv

Download

[PDF]478.9kB  

Abstract

Chore division is a class of fair division problems in which some undesirable"resource" must be shared among a set of participants, with each participantwanting to get as little as possible. Typically the set of participants isfixed and known at the outset. This paper introduces a novel variant, calledsequential online chore division (SOCD), in which participants arrive anddepart online, while the chore is being performed: both the total number ofparticipants and their arrival/departure times are initially unknown. In SOCD,exactly one agent must be performing the chore at any give time (e.g. keepinglookout), and switching the performer incurs a cost. In this paper, we proposeand analyze three mechanisms for SOCD: one centralized mechanism using sidepayments, and two distributed ones that seek to balance the participants'loads. Analysis and results are presented in a domain motivated by autonomousvehicle convoy formation, where the chore is leading the convoy so that allfollowers can enjoy reduced wind resistance.

BibTeX Entry

@Techreport{Convoy-Yedidsion,
	author = {Harel Yedidsion and Shani Alkoby and Peter Stone}, 
	title = {Sequential Online Chore Division for Autonomous Vehicle Convoy Formation},
	month = {April},
	year = {2021},
        institution = "arXiv", 
	number = "arXiv e-Prints 2104.04159",
	abstract = {
	Chore division is a class of fair division problems in which some undesirable
"resource" must be shared among a set of participants, with each participant
wanting to get as little as possible. Typically the set of participants is
fixed and known at the outset. This paper introduces a novel variant, called
sequential online chore division (SOCD), in which participants arrive and
depart online, while the chore is being performed: both the total number of
participants and their arrival/departure times are initially unknown. In SOCD,
exactly one agent must be performing the chore at any give time (e.g. keeping
lookout), and switching the performer incurs a cost. In this paper, we propose
and analyze three mechanisms for SOCD: one centralized mechanism using side
payments, and two distributed ones that seek to balance the participants'
loads. Analysis and results are presented in a domain motivated by autonomous
vehicle convoy formation, where the chore is leading the convoy so that all
followers can enjoy reduced wind resistance.
	},
	wwwnote={<a href="http://arxiv.org/abs/2104.04159">arXiv</a>},
}

Generated by bib2html.pl (written by Patrick Riley ) on Fri Jun 18, 2021 14:00:34