Show simple item record

dc.contributor.advisorAli, Abu Mohammad Hammad
dc.contributor.advisorAbdallah, Dr. Wahid
dc.contributor.authorReza, Adnan
dc.contributor.authorMahmud, Akib
dc.contributor.authorSabrin, Shaila
dc.date.accessioned2015-02-06T06:52:39Z
dc.date.available2015-02-06T06:52:39Z
dc.date.copyright2014
dc.date.issued2014
dc.identifier.otherID 14141012
dc.identifier.otherID 14341014
dc.identifier.otherID 14141013
dc.identifier.urihttp://hdl.handle.net/10361/3975
dc.descriptionThis thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2014.en_US
dc.descriptionCataloged from PDF version of thesis report.
dc.descriptionIncludes bibliographical references (page 25 - 26).
dc.description.abstractWe aim to use cryptography to solve a game-theoretic problem which is prevalent in the area of two party strategic games. The standard game-theoretic solutions concept for such games is that of a Nash equilibrium: a pair of “self-enforcing” strategies which makes each player’s strategy an optimal response to the other player’s strategy. It is known that for many games the expected equilibrium payoffs can be much higher when a trusted third party i.e. a “mediator” assists in choosing their moves (correlated equilibria), than when each play has to choose its move on its own (Nash Equilibria). It is natural to ask whether there exists a mechanism (cryptographic protocol) that eliminates the need for the mediator yet allows the players to maintain the high payoffs offered by mediator-assisted strategies. We answer this question by extending the original game by adding an initial step in which the two players communicate, and then proceed to execute the game as usual. By incorporating our cryptographic protocol into a game-theoretic setting, we hope to highlight some interesting parallels between cryptographic protocols and two-party games. An interesting aspect of our work is the synergy achieved between cryptographic algorithms and game-theoretic problems: By implementing the cryptographic protocol in the game theoretic problem, we gain in the game theory front by eliminating the need for the mediator; we also gain on the cryptography front: for instance, we eliminate the problem of early stopping.en_US
dc.description.statementofresponsibilityAdnan Reza
dc.description.statementofresponsibilityAkib Mahmud
dc.description.statementofresponsibilityShaila Sabrin
dc.format.extent26 pages
dc.language.isoenen_US
dc.publisherBRAC Universityen_US
dc.rightsBRAC University thesis are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subjectComputer science and engineeringen_US
dc.subjectCryptographyen_US
dc.titleApply crytography to achieve optimality in a game-theoretic problemen_US
dc.typeThesisen_US
dc.contributor.departmentDepartment of Computer Science and Engineering, BRAC University
dc.description.degreeB. Computer Science and Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record