[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

How to (Carefully) Breach a Service Contract?

  • Chapter
  • First Online:
The New Codebreakers

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9100))

  • 2626 Accesses

Abstract

Consider a firm \(\mathcal {S}\) providing support to clients \(\mathcal {A}\) and \(\mathcal {B}\).

The contract \(\mathcal {S} \leftrightarrow \mathcal {A}\) stipulates that \(\mathcal {S}\) must continuously serve \(\mathcal {A}\) and answer its calls immediately. While servicing \(\mathcal {A}\), \(\mathcal {S}\) incurs two costs: personnel fees (salaries) that \(\mathcal {A}\) refunds on a per-call-time basis and technical fees that are not refunded.

The contract \(\mathcal {S} \leftrightarrow \mathcal {B}\) is a pay-per-call agreement where \(\mathcal {S}\) gets paid an amount proportional to \(\mathcal {B}\)’s incoming call’s duration. We consider that the flow of incoming \(\mathcal {B}\) calls is unlimited and regular.

\(\mathcal {S}\) wishes to use his workforce for both tasks, switching from \(\mathcal {A}\) to \(\mathcal {B}\) if necessary. As \(\mathcal {S} \leftrightarrow \mathcal {B}\) generates new benefits and \(\mathcal {S} \leftrightarrow \mathcal {A}\) is the fulfilling of a contracted obligation, \(\mathcal {S}\) would like to devote as little resources as necessary to support \(\mathcal {A}\) and divert as much workforce as possible to serve \(\mathcal {B}\). Hence, \(\mathcal {S}\)’s goal is to minimize his availability to serve \(\mathcal {A}\) without incurring too high penalties.

This paper models \(\mathcal {A}\) as a naïve player. This captures \(\mathcal {A}\)’s needs but not \(\mathcal {A}\)’s game-theoretic interests – which thorough investigation remains an open question.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
GBP 17.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 21.90
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    i.e. 1–900 call.

  2. 2.

    The model can be easily generalized to cases where working for \(\mathcal {B}\) generates a positive margin.

  3. 3.

    \(\ell \) represents the legal fees, image negative impact and compensations paid to \(\mathcal {A}\).

  4. 4.

    Assume, for instance, that \(x(t)=10\) calls/hour and consider a one second time interval \(\varDelta T = 1/3600\) h. The probability to witness a call during \(\varDelta T\) is indeed \(10 \varDelta T=1/360\). During each one second time interval the probability to witness a call is 1 / 360 and over 3600 s we indeed get an average of 10 calls. Hence, p is indeed the probability to witness a call between time t and \(t+\varDelta T\) when \(\varDelta T\) is very small.

Acknowledgment

We thank Jean-Sébastien Coron for his contribution to this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Naccache .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chevalier, C., Gaumont, D., Naccache, D., Do Canto, R.P. (2016). How to (Carefully) Breach a Service Contract?. In: Ryan, P., Naccache, D., Quisquater, JJ. (eds) The New Codebreakers. Lecture Notes in Computer Science(), vol 9100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49301-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49301-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49300-7

  • Online ISBN: 978-3-662-49301-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics