How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling

Eric Brier; David Naccache; Li-yao Xia

doi:10.1007/978-3-319-10683-0_13

How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling

Eric Brier, David Naccache, Li-yao Xia

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

This chapter explores ways of performing a kind of commutative task by N parties, of which a particular scenario of contract signing is a canonical example. Tasks are defined as commutative if the order in which parties perform them can be freely changed without affecting the final result. It is easy to see that arbitrary N-party commutative tasks cannot be completed in less than N − 1 basic time units.

Original language	English
Title of host publication	Open Problems in Mathematics and Computational Science
Editors	Çetin Kaya Koç
Place of Publication	Cham
Publisher	Springer
Chapter	13
Pages	317-340
Number of pages	24
ISBN (Electronic)	978-3-319-10683-0
ISBN (Print)	978-3-319-10682-3, 978-3-319-36497-1
DOIs	https://doi.org/10.1007/978-3-319-10683-0_13
Publication status	Published - 11 Nov 2014

Access to Document

10.1007/978-3-319-10683-0_13Licence: All Rights Reserved

https://link.springer.com/chapter/10.1007/978-3-319-10683-0_13Licence: All Rights Reserved

Cite this

@inbook{f990c1f1416944b6849bf180c105db15,

title = "How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling",

abstract = "This chapter explores ways of performing a kind of commutative task by N parties, of which a particular scenario of contract signing is a canonical example. Tasks are defined as commutative if the order in which parties perform them can be freely changed without affecting the final result. It is easy to see that arbitrary N-party commutative tasks cannot be completed in less than N − 1 basic time units.",

author = "Eric Brier and David Naccache and Li-yao Xia",

year = "2014",

month = nov,

day = "11",

doi = "10.1007/978-3-319-10683-0\_13",

language = "English",

isbn = "978-3-319-10682-3",

pages = "317--340",

editor = "Ko{\c c}, \{{\c C}etin Kaya\}",

booktitle = "Open Problems in Mathematics and Computational Science",

publisher = "Springer",

address = "United Kingdom",

}

TY - CHAP

T1 - How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling

AU - Brier, Eric

AU - Naccache, David

AU - Xia, Li-yao

PY - 2014/11/11

Y1 - 2014/11/11

N2 - This chapter explores ways of performing a kind of commutative task by N parties, of which a particular scenario of contract signing is a canonical example. Tasks are defined as commutative if the order in which parties perform them can be freely changed without affecting the final result. It is easy to see that arbitrary N-party commutative tasks cannot be completed in less than N − 1 basic time units.

AB - This chapter explores ways of performing a kind of commutative task by N parties, of which a particular scenario of contract signing is a canonical example. Tasks are defined as commutative if the order in which parties perform them can be freely changed without affecting the final result. It is easy to see that arbitrary N-party commutative tasks cannot be completed in less than N − 1 basic time units.

U2 - 10.1007/978-3-319-10683-0_13

DO - 10.1007/978-3-319-10683-0_13

M3 - Chapter

SN - 978-3-319-10682-3

SN - 978-3-319-36497-1

SP - 317

EP - 340

BT - Open Problems in Mathematics and Computational Science

A2 - Koç, Çetin Kaya

PB - Springer

CY - Cham

ER -

How to Sign Paper Contracts? Conjectures and Evidence Related to Equitable and Efficient Collaborative Task Scheduling

Abstract

Access to Document

Fingerprint

Cite this