Synthical
Your space
Profile
Activity
Favorites
Folders
Feeds
All articles
Claim page
Shant Boodaghians
Follow
Activity
Upvotes
Folders
Articles
9
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores
17 July 2021 by
Shant Boodaghians
and
others
Computer Science and Game Theory
,
Data Structures and Algorithms
Smoothed Complexity of 2-player Nash Equilibria
21 July 2020 by
Shant Boodaghians
and
others
Computer Science and Game Theory
,
Computational Complexity
Pandora's Box Problem with Order Constraints
29 May 2020 by
Shant Boodaghians
and
others
Computer Science and Game Theory
,
Data Structures and Algorithms
Online Revenue Maximization for Server Pricing
19 July 2019 by
Shant Boodaghians
and
others
Computer Science and Game Theory
Performance Metric Elicitation from Pairwise Classifier Comparisons
18 January 2019 by
Gaurush Hiranandani
and
others
Machine Learning
Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games
12 November 2018 by
Shant Boodaghians
and
others
Computational Complexity
Revealed Preference Dimension via Matrix Sign Rank
28 July 2018 by
Shant Boodaghians
Computer Science and Game Theory
Testing Consumer Rationality using Perfect Graphs and Oriented Discs
27 October 2015 by
Shant Boodaghians
and
Adrian Vetta
Computational Complexity
,
Data Structures and Algorithms
The Combinatorial World (of Auctions) According to GARP
27 July 2015 by
Shant Boodaghians
and
Adrian Vetta
Computer Science and Game Theory
This is an AI-generated summary
Key points
Topics
Computer Science and Game Theory
Data Structures and Algorithms
Computational Complexity
Machine Learning