An algorithmic approach to Nash implementation with two individuals

buir.advisorDalkıran, Nuh Aygün
dc.contributor.authorUğuz, Güneş
dc.date.accessioned2024-08-15T13:41:41Z
dc.date.available2024-08-15T13:41:41Z
dc.date.copyright2024-07
dc.date.issued2024-07
dc.date.submitted2024-08-09
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionIncludes bibliographical references (leaves 38-42).en_US
dc.description.abstractThis thesis investigates the Nash implementation problem in the behavioral domain with two individuals. By strengthening the necessary results in the literature and adopting an algorithmic approach, we provide constructive sufficiency results. Our findings facilitate the design of mechanisms in two individual environments where the individuals’ behavior may violate the standard axioms of rationality.
dc.description.statementofresponsibilityby Güneş Uğuz
dc.format.extentvii, 42 leaves ; 30 cm.
dc.identifier.itemidB162592
dc.identifier.urihttps://hdl.handle.net/11693/115742
dc.language.isoEnglish
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectNash implementation
dc.subjectBehavioral implementation
dc.subjectTwo individual consistency
dc.titleAn algorithmic approach to Nash implementation with two individuals
dc.title.alternativeİki bireyli Nash uygulaması için algoritmik bir yaklaşım
dc.typeThesis
thesis.degree.disciplineEconomics
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMA (Master of Arts)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
B162592.pdf
Size:
587.22 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.1 KB
Format:
Item-specific license agreed upon to submission
Description: