Negotiation Games

Article, Preprint English OPEN
Hoffmann, Philipp;
(2015)
  • Publisher: Open Publishing Association
  • Journal: Electronic Proceedings in Theoretical Computer Science (issn: 2075-2180)
  • Publisher copyright policies & self-archiving
  • Related identifiers: doi: 10.4204/EPTCS.193.3
  • Subject: Mathematics | Electronic computers. Computer science | Computer Science - Logic in Computer Science | QA1-939 | QA75.5-76.95
    acm: ComputerApplications_COMPUTERSINOTHERSYSTEMS

Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced by J. Desel and J. Esparza. We initiate the study of games for this model. We study coalition problems: can a given coalition of agents force that a negotiation... View more
  • References (12)
    12 references, page 1 of 2

    [1] Luca de Alfaro, Thomas A. Henzinger & Orna Kupferman (2007): Concurrent reachability games. Theor. Comput. Sci. 386(3), pp. 188-217. Available at http://dx.doi.org/10.1016/j.tcs.2007.07.008.

    [2] Rajeev Alur, Thomas A. Henzinger & Orna Kupferman (2002): Alternating-time temporal logic. J. ACM 49(5), pp. 672-713. Available at http://doi.acm.org/10.1145/585265.585270.

    [3] Toma´s Bra´zdil, Petr Jancar & Anton´ın Kucera (2010): Reachability Games on Extended Vector Addition Systems with States. In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide

    [4] Ashok K. Chandra, Dexter Kozen & Larry J. Stockmeyer (1981): Alternation. J. ACM 28(1), pp. 114-133, doi:10.1145/322234.322243.

    [5] Javier Esparza & Jo¨rg Desel (2013): On Negotiation as Concurrency Primitive. In Pedro R. D'Argenio & Herna´n C. Melgratti, editors: CONCUR, Lecture Notes in Computer Science 8052, Springer, pp. 440-454. Available at http://dx.doi.org/10.1007/978-3-642-40184-8_31.

    [6] Javier Esparza & Jo¨rg Desel (2014): On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations. In Anca Muscholl, editor: FoSSaCS, Lecture Notes in Computer Science 8412, Springer, pp. 258-273. Available at http://dx.doi.org/10.1007/978-3-642-54830-7_17.

    [7] Paul Gastin, Nathalie Sznajder & Marc Zeitoun (2009): Distributed synthesis for wellconnected architectures. Formal Methods in System Design 34(3), pp. 215-237. Available at http://dx.doi.org/10.1007/s10703-008-0064-7.

    [8] Blaise Genest, Hugo Gimbert, Anca Muscholl & Igor Walukiewicz (2013): Asynchronous Games over Tree Architectures. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska & David Peleg, editors: ICALP (2), Lecture Notes in Computer Science 7966, Springer, pp. 275-286. Available at http://dx.doi.org/10.1007/978-3-642-39212-2_26.

    [9] Anton´ın Kucera (2012): Playing Games with Counter Automata. In Alain Finkel, Je´roˆme Leroux & Igor Potapov, editors: RP, Lecture Notes in Computer Science 7550, Springer, pp. 29-41. Available at http://dx.doi.org/10.1007/978-3-642-33512-9_4.

    [10] Swarup Mohalik & Igor Walukiewicz (2003): Distributed Games. In Paritosh K. Pandya & Jaikumar Radhakrishnan, editors: FSTTCS, Lecture Notes in Computer Science 2914, Springer, pp. 338-351. Available at http://dx.doi.org/10.1007/978-3-540-24597-1_29.

  • Metrics
Share - Bookmark