| Publication | Date of Publication | Type |
|---|
| Core stability and Nash stability in k-tiered coalition formation games | 2025-03-25 | Paper |
Socially conscious stability for tiered coalition formation games
Annals of Mathematics and Artificial Intelligence | 2024-09-02 | Paper |
Multi-agent reinforcement learning for decentralized stable matching
(available as arXiv preprint) | 2023-03-31 | Paper |
Reasoning with PCP-nets
Journal of Artificial Intelligence Research | 2022-02-07 | Paper |
The complexity of campaigning
(available as arXiv preprint) | 2018-10-25 | Paper |
The complexity of probabilistic lobbying
Discrete Optimization | 2018-08-17 | Paper |
Uniform random generation and dominance testing for CP-nets
Journal of Artificial Intelligence Research | 2017-10-24 | Paper |
On the complexity of bribery and manipulation in tournaments with uncertain information
Journal of Applied Logic | 2015-12-23 | Paper |
Complexity of finite-horizon Markov decision process problems
Journal of the ACM | 2015-12-17 | Paper |
Beyond theory and data in preference modeling: bringing humans into the loop
Algorithmic Decision Theory | 2015-11-04 | Paper |
More theory revision with queries (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Learning CP-net preferences online from user queries
Algorithmic Decision Theory | 2013-12-17 | Paper |
Roles and teams hedonic game
Algorithmic Decision Theory | 2013-12-17 | Paper |
| Topological value iteration algorithms | 2012-01-12 | Paper |
A natural language argumentation interface for explanation generation in Markov decision processes
Algorithmic Decision Theory | 2011-10-28 | Paper |
| New Horn revision algorithms | 2011-10-12 | Paper |
Ranking policies in discrete Markov decision processes
Annals of Mathematics and Artificial Intelligence | 2011-02-03 | Paper |
The Complexity of Probabilistic Lobbying
Algorithmic Decision Theory | 2009-11-17 | Paper |
Finding Best k Policies
Algorithmic Decision Theory | 2009-11-17 | Paper |
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation | 2008-08-22 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
A framework for management of semistructured probabilistic data
Journal of Intelligent Information Systems | 2006-05-02 | Paper |
Theory revision with queries: Horn, read-once, and parity formulas
Artificial Intelligence | 2006-02-07 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Databases for interval probabilities
International Journal of Intelligent Systems | 2005-01-12 | Paper |
Tally NP sets and easy census functions.
Information and Computation | 2003-01-14 | Paper |
Theory revision with queries: DNF formulas
Machine Learning | 2002-04-11 | Paper |
Nonapproximability results for partially observable Markov decision processes
The Journal of Artificial Intelligence Research (JAIR) | 2001-06-18 | Paper |
| scientific article; zbMATH DE number 1361472 (Why is no real title available?) | 2000-11-08 | Paper |
An algorithm for the class of pure implicational formulas
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1335900 (Why is no real title available?) | 1999-09-13 | Paper |
| scientific article; zbMATH DE number 1222583 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1300961 (Why is no real title available?) | 1999-06-16 | Paper |
| scientific article; zbMATH DE number 1222092 (Why is no real title available?) | 1999-03-02 | Paper |
| scientific article; zbMATH DE number 1216123 (Why is no real title available?) | 1998-10-28 | Paper |
L-Printable Sets
SIAM Journal on Computing | 1998-09-21 | Paper |
Sharply bounded alternation and quasilinear time
Theory of Computing Systems | 1998-05-26 | Paper |
Scalability and the isomorphism problem
Information Processing Letters | 1997-02-27 | Paper |
Relativized isomorphisms of NP-complete sets
Computational Complexity | 1993-10-18 | Paper |
Nondeterminism within $P^ * $
SIAM Journal on Computing | 1993-09-01 | Paper |
| scientific article; zbMATH DE number 176517 (Why is no real title available?) | 1993-05-18 | Paper |
Polynomial-time compression
Computational Complexity | 1993-01-16 | Paper |
