| Publication | Date of Publication | Type |
|---|
| Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents | 2024-09-20 | Paper |
| Blockchain participation games | 2024-09-20 | Paper |
| A polynomial-time algorithm for 1/2-well-supported Nash equilibria in bimatrix games | 2024-05-14 | Paper |
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
ACM Transactions on Algorithms | 2023-10-23 | Paper |
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
SIAM Journal on Computing | 2023-09-29 | Paper |
On improved interval cover mechanisms for crowdsourcing markets
Algorithmic Game Theory | 2023-07-28 | Paper |
| Towards a characterization of worst case equilibria in the discriminatory price auction | 2022-07-06 | Paper |
| An approval-based model for single-step liquid democracy | 2022-06-01 | Paper |
Cost sharing over combinatorial domains : Complement-free cost functions and beyond
(available as arXiv preprint) | 2022-05-11 | Paper |
On envy-free revenue approximation for combinatorial buyers with budgets
Theory of Computing Systems | 2021-06-11 | Paper |
Inequity aversion pricing over social networks: approximation algorithms and hardness results
Theoretical Computer Science | 2021-06-08 | Paper |
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
Information Processing Letters | 2020-10-07 | Paper |
Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
Theoretical Computer Science | 2020-09-17 | Paper |
| On core-selecting and core-competitive mechanisms for binary single-parameter auctions | 2020-06-30 | Paper |
Tight welfare guarantees for pure Nash equilibria of the uniform price auction
Theory of Computing Systems | 2019-09-05 | Paper |
Cooperative games with overlapping coalitions: charting the tractability frontier
Artificial Intelligence | 2019-08-28 | Paper |
On budget-feasible mechanism design for symmetric submodular objectives
Web and Internet Economics | 2019-01-30 | Paper |
Approximation Algorithms for Computing Maximin Share Allocations
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Approximation Algorithms for Computing Maximin Share Allocations
ACM Transactions on Algorithms | 2018-11-12 | Paper |
An improved envy-free cake cutting protocol for four agents
(available as arXiv preprint) | 2018-11-08 | Paper |
| An improved envy-free cake cutting protocol for four agents | 2018-11-08 | Paper |
Inequity aversion pricing over social networks: approximation algorithms and hardness results
(available as arXiv preprint) | 2018-03-21 | Paper |
Tight welfare guarantees for pure Nash equilibria of the uniform price auction
Algorithmic Game Theory | 2018-02-13 | Paper |
Item bidding for combinatorial public projects
Theoretical Computer Science | 2017-05-15 | Paper |
Paradoxes in social networks with multiple products
Synthese | 2017-03-14 | Paper |
Paradoxes in social networks with multiple products
Synthese | 2017-03-14 | Paper |
Coverage, matching, and beyond: new results on budgeted mechanism design
Web and Internet Economics | 2017-02-10 | Paper |
Item Pricing for Combinatorial Public Projects
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Envy-free revenue approximation for asymmetric buyers with budgets
Algorithmic Game Theory | 2016-09-29 | Paper |
On the stability of generalized second price auctions with budgets
Theory of Computing Systems | 2016-09-21 | Paper |
Characteristic function games with restricted agent interactions: core-stability and coalition structures
Artificial Intelligence | 2016-02-09 | Paper |
Uniform price auctions: equilibria and efficiency
Theory of Computing Systems | 2016-01-13 | Paper |
Beyond plurality: truth-bias in binary scoring rules
Algorithmic Decision Theory | 2015-11-04 | Paper |
Equilibria of plurality voting: lazy and truth-biased voters
Algorithmic Game Theory | 2015-11-04 | Paper |
Cost-sharing models in participatory sensing
Algorithmic Game Theory | 2015-11-04 | Paper |
The web graph as an equilibrium
Algorithmic Game Theory | 2015-11-04 | Paper |
Approximation algorithms for computing maximin share allocations
Automata, Languages, and Programming | 2015-10-27 | Paper |
Influence maximization in switching-selection threshold models
Algorithmic Game Theory | 2015-01-14 | Paper |
Arbitration and stability in cooperative games with overlapping coalitions
The Journal of Artificial Intelligence Research (JAIR) | 2014-09-05 | Paper |
On multiprocessor temperature-aware scheduling problems
Journal of Scheduling | 2014-08-18 | Paper |
Social networks with competing products
Fundamenta Informaticae | 2014-04-11 | Paper |
On the stability of generalized second price auctions with budgets
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Plurality voting with truth-biased agents
Algorithmic Game Theory | 2013-10-23 | Paper |
Inefficiency of standard multi-unit auctions
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Uniform price auctions: equilibria and efficiency
Algorithmic Game Theory | 2013-03-13 | Paper |
Undominated Groves mechanisms
Journal of Artificial Intelligence Research | 2013-02-25 | Paper |
On multiprocessor temperature-aware scheduling problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Diffusion in social networks with competing products
Algorithmic Game Theory | 2011-10-28 | Paper |
Cooperative Games with Overlapping Coalitions
Journal of Artificial Intelligence Research | 2010-11-10 | Paper |
On the Fourier spectrum of symmetric Boolean functions
Combinatorica | 2010-08-13 | Paper |
Integrality gaps of semidefinite programs for vertex cover and relations to \(\ell_1\) embeddability of negative type metrics
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science | 2009-12-01 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Inapproximability results for combinatorial auctions with submodular utility functions
Algorithmica | 2008-09-12 | Paper |
| Some Remarks on the Jacobian Conjecture and Connections with Hilbert's Irreducibility Theorem | 2005-07-26 | Paper |
| Learning symmetric k-juntas in time n^o(k) | 2005-04-12 | Paper |
| scientific article; zbMATH DE number 1833407 (Why is no real title available?) | 2002-11-21 | Paper |
