Judy Goldsmith

Gov. Inf. Q., 2022

Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demand.

[BibT_eX]

[DOI]

CoRR, 2022

Learning Outcomes and Assessments for Ethical Computing.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

SIGCSE Reads 2022: Using Challenging Stories in your Classroom.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

Extensions on Tiered Coalition Formation Games.

[BibT_eX]

[DOI]

Nathan Arnold

Sarah H. Snider

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

The Power of Symmetry for Nash Stable Additively Separable Hedonic Games.

[BibT_eX]

[DOI]

Christian Addington

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Modelling Cournot Games as Multi-agent Multi-armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, 2022

Extensions to Tiered Coalition Formation Games.

[BibT_eX]

[DOI]

Nathan Arnold

Sarah H. Snider

Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, 2022

2021

Reasoning with PCP-Nets.

[BibT_eX]

[DOI]

Kristen Brent Venable

J. Artif. Intell. Res., 2021

Coalition Formation Games (Dagstuhl Seminar 21331).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

SIGCSE Reads 2021: Using the Stories in your Classroom.

[BibT_eX]

[DOI]

Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Anchored Team Formation Games.

[BibT_eX]

[DOI]

Christian Addington

Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, 2021

Multi-agent Reinforcement Learning for Decentralized Stable Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

Software for Agent-based Network Simulation and Visualization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Opinion Diffusion Software with Strategic Opinion Revelation and Unfriending.

[BibT_eX]

[DOI]

Patrick Shepherd

Mia Weaver

CoRR, 2020

Reinforcement Learning for Decentralized Stable Matching.

[BibT_eX]

[DOI]

CoRR, 2020

Assessment of CS Students' Ethical Reasoning Skills.

[BibT_eX]

[DOI]

Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

SIGCSE Reads 2020: Author Discussion and Q & A.

[BibT_eX]

[DOI]

Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

Decentralized Marriage Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

Super Altruistic Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

Internal Stability in Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

Discovering Hierarchies for Reinforcement Learning Using Data Mining.

[BibT_eX]

[DOI]

Dave Mobley

Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, 2020

An Investigation into the Sensitivity of Social Opinion Networks to Heterogeneous Goals and Preferences.

[BibT_eX]

[DOI]

Patrick Shepherd

Mia Weaver

Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020

A Reinforcement Learning Approach to Strategic Belief Revelation with Social Influence.

[BibT_eX]

[DOI]

Patrick Shepherd

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Assessing Ethical Thinking about AI.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

SIGCSE Reads 2019: Discussion and Q & A.

[BibT_eX]

[DOI]

Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

2018

How to teach computer ethics through science fiction.

[BibT_eX]

[DOI]

Commun. ACM, 2018

Decentralized Multiagent Approach for Hedonic Games.

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent Systems - 16th European Conference, 2018

The Heart of the Matter: Patient Autonomy as a Model for the Wellbeing of Technology Users.

[BibT_eX]

[DOI]

Proceedings of the 2018 AAAI Spring Symposia, 2018

2017

Uniform Random Generation and Dominance Testing for CP-Nets.

[BibT_eX]

[DOI]

Hayden Elizabeth Justice

Kayla Raines

J. Artif. Intell. Res., 2017

Ethical Considerations in Artificial Intelligence Courses.

[BibT_eX]

[DOI]

AI Mag., 2017

Learning Tree-Structured CP-Nets with Local Search.

[BibT_eX]

[DOI]

Cory Siler

Proceedings of the Thirtieth International Florida Artificial Intelligence Research Society Conference, 2017

The Complexity of Campaigning.

[BibT_eX]

[DOI]

Cory Siler

Luke Harold Miles

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Why Teaching Ethics to AI Practitioners Is Important.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

A Tool to Graphically Edit CP-Nets.

[BibT_eX]

[DOI]

Aidan Shafran

Sam Saarinen

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Model AI Assignments 2016.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Using "The Machine Stops" for Teaching Ethics in Artificial Intelligence and Computer Science.

[BibT_eX]

[DOI]

Proceedings of the AI, 2016

Generating CP-Nets Uniformly at Random.

[BibT_eX]

[DOI]

Hayden Elizabeth Justice

Kayla Raines

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

On the complexity of bribery and manipulation in tournaments with uncertain information.

[BibT_eX]

[DOI]

J. Appl. Log., 2015

Who is watching you eat?: a noir preferences thriller.

[BibT_eX]

[DOI]

AI Matters, 2015

SIGCSE Reads: Time for Book Discussion (Abstract Only).

[BibT_eX]

[DOI]

Rebecca Bates

Valerie Summet

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

Stability in Role Based Hedonic Games.

[BibT_eX]

[DOI]

Matthew Spradling

Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, 2015

Probabilistic Copeland Tournaments.

[BibT_eX]

[DOI]

Sam Saarinen

Craig A. Tovey

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Reasoning with PCP-nets in a Multi-Agent Context.

[BibT_eX]

[DOI]

Kristen Brent Venable

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop.

[BibT_eX]

[DOI]

Christopher E. Zwilling

Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Teaching AI Ethics Using Science Fiction.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Ethics, 2015

2014

Fiction as an Introduction to Computer Science Research.

[BibT_eX]

[DOI]

ACM Trans. Comput. Educ., 2014

The complexity of probabilistic lobbying.

[BibT_eX]

[DOI]

Daniel Binkele-Raible

Discret. Optim., 2014

Online discussions: improving education in CS?

[BibT_eX]

[DOI]

Radu Paul Mihail

Beth Rubin

Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

Using science fiction in CS courses (abstract only).

[BibT_eX]

[DOI]

Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

A Model for Intransitive Preferences.

[BibT_eX]

[DOI]

Sam Saarinen

Craig A. Tovey

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Who is Watching You Eat?

[BibT_eX]

[DOI]

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Voting with Rank Dependent Scoring Rules.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Counting, Ranking, and Randomly Generating CP-Nets.

[BibT_eX]

[DOI]

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013

Uncertain Data: Representations, Query Processing, and Applications.

[BibT_eX]

[DOI]

Tingjian Ge

Proceedings of the Advances in Probabilistic Databases for Uncertain Information Management, 2013

An English-Language Argumentation Interface for Explanation Generation with Markov Decision Processes in the Domain of Academic Advising.

[BibT_eX]

[DOI]

ACM Trans. Interact. Intell. Syst., 2013

Lessons Learned from Creating a Course Advising Tool.

[BibT_eX]

[DOI]

CoRR, 2013

Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface.

[BibT_eX]

[DOI]

Jörg Rothe

Ann. Math. Artif. Intell., 2013

Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Teaching graphics for games using Microsoft XNA.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Computer Games: AI, 2013

Updates and Uncertainty in CP-Nets.

[BibT_eX]

[DOI]

Kristen Brent Venable

Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

Roles and Teams Hedonic Game.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Learning CP-Net Preferences Online from User Queries.

[BibT_eX]

[DOI]

Joshua T. Guerin

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

Science fiction in computer science education.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information.

[BibT_eX]

[DOI]

Nicholas Scott Mattei

Andrew Klapper

Proceedings of the Machine Aggregation of Human Judgment, 2012

2011

Topological Value Iteration Algorithms.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes.

[BibT_eX]

Thomas Dodson

Proceedings of the Explanation-aware Computing, 2011

Science Fiction as an Introduction to AI Research.

[BibT_eX]

[DOI]

Proceedings of the Second Symposium on Education Advances in Artificial Intelligence, 2011

2010

Decision-theoretic harmony: A first step.

[BibT_eX]

[DOI]

Liangrong Yi

Int. J. Approx. Reason., 2010

Introduction to the special issue on Bayesian model views.

[BibT_eX]

[DOI]

Kathryn B. Laskey

Int. J. Approx. Reason., 2010

Ranking policies in discrete Markov decision processes.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2010

2009

Planning for success: The interdisciplinary approach to building Bayesian models.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2009

Workshop summary: Seventh annual workshop on Bayes applications.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Finding Best <i>k</i> Policies.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008

The Computational Complexity of Dominance and Consistency in CP-Nets.

[BibT_eX]

[DOI]

Jérôme Lang

Miroslaw Truszczynski

Nic Wilson

J. Artif. Intell. Res., 2008

Complexity of DNF minimization and isomorphism testing for monotone formulas.

[BibT_eX]

[DOI]

Matthias Hagen

Inf. Comput., 2008

Preference Handling for Artificial Intelligence.

[BibT_eX]

[DOI]

Ulrich Junker

AI Mag., 2008

Planning for Welfare to Work.

[BibT_eX]

[DOI]

Liangrong Yi

Raphael A. Finkel

Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

A bottom-up approach to welfare case management decision support software.

[BibT_eX]

[DOI]

Proceedings of the 9th Annual International Conference on Digital Government Research, 2008

Expediting RL by using graphical structures.

[BibT_eX]

[DOI]

Alexander L. Strehl

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007

AAAI-07 Workshop Reports.

[BibT_eX]

[DOI]

AI Mag., 2007

Automatic Generation of Four-part Harmony.

[BibT_eX]

[DOI]

Liangrong Yi

Proceedings of the Fifth UAI Bayesian Modeling Applications Workshop (UAI-AW 2007), 2007

Competition Adds Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

Topological Value Iteration Algorithm for Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Multi-Threaded BLAO* Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

2006

Factored MDP Elicitation and Plan Display.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

New Horn Revision Algorithms.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2005

A Framework for Management of Semistructured Probabilistic Data.

[BibT_eX]

[DOI]

J. Intell. Inf. Syst., 2005

Complexity of DNF and Isomorphism of Monotone Formulas.

[BibT_eX]

[DOI]

Matthias Hagen

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Adaptive Decision Support for Planning under Hard and Soft Constraints.

[BibT_eX]

[DOI]

Proceedings of the Challenges to Decision Support in a Changing World, 2005

2004

Databases for interval probabilities.

[BibT_eX]

[DOI]

Int. J. Intell. Syst., 2004

Building Bayes Nets with Semistructured Probabilistic DBMS.

[BibT_eX]

EMISA Forum, 2004

Theory revision with queries: Horn, read-once, and parity formulas.

[BibT_eX]

[DOI]

Artif. Intell., 2004

Preferences and Domination.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methods in Computational Complexity, 10.-15. October 2004, 2004

New Revision Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

When Plans Distinguish Bayes Nets.

[BibT_eX]

[DOI]

Janice L. Pearce

Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2003

Revising Unique Explanations.

[BibT_eX]

Jignesh Doshi

Venkata Deepti Kiran Bhuma

Proceedings of the MAICS 2003, 2003

Bidirectional LAO* algorithm.

[BibT_eX]

Proceedings of the 1st Indian International Conference on Artificial Intelligence, 2003

Can Probabilistic Databases Help Elect Qualified Officials?

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003

Query Algebra Operations for Interval Probabilities.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 14th International Conference, 2003

2002

Theory Revision with Queries: DNF Formulas.

[BibT_eX]

[DOI]

György Turán

Mach. Learn., 2002

2001

Semistructured Probalistic Databases.

[BibT_eX]

[DOI]

Sean R. Hawkes

Proceedings of the 13th International Conference on Scientific and Statistical Database Management, 2001

2000

Nonapproximability Results for Partially Observable Markov Decision Processes

[BibT_eX]

Christopher Lusena

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2000

Book review: Theory of Computing: A Gentle Introduction by Kinber and Smith (Prentice-Hall, 2001).

[BibT_eX]

[DOI]

SIGACT News, 2000

Tally NP Sets and Easy Census Functions.

[BibT_eX]

[DOI]

Mitsunori Ogihara

Jörg Rothe

Inf. Comput., 2000

More theory revision with queries (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Improved Algorithms for Theory Revision with Queries.

[BibT_eX]

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

The Complexity of Model Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999

Complexity of Finite-Horizon Markov Decision process Problems.

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

An Algorithm for the Class of Pure Implicational Formulas.

[BibT_eX]

[DOI]

Ramjee P. Swaminathan

Discret. Appl. Math., 1999

My Brain is Full: When More Memory Helps.

[BibT_eX]

[DOI]

Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

1998

L-Printable Sets.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Downward Separation Fails Catastrophically for Limited Nondeterminism Classes.

[BibT_eX]

[DOI]

Richard Beigel

SIAM J. Comput., 1998

Sharply Bounded Alternation and Quasilinear Time.

[BibT_eX]

[DOI]

Stephen A. Bloch

Theory Comput. Syst., 1998

The Computational Complexity of Probabilistic Planning.

[BibT_eX]

[DOI]

Michael L. Littman

J. Artif. Intell. Res., 1998

Complexity Issues in Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

The Complexity of Plan Existence and Evaluation in Probabilistic Domains.

[BibT_eX]

[DOI]

Michael L. Littman

Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes.

[BibT_eX]

[DOI]

Eric Allender

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

Limited nondeterminism.

[BibT_eX]

[DOI]

Matthew A. Levy

SIGACT News, 1996

The future of computational complexity theory: part II.

[BibT_eX]

[DOI]

SIGACT News, 1996

Scalability and the Isomorphism Problem.

[BibT_eX]

[DOI]

Steven Homer

Inf. Process. Lett., 1996

Sharply Bounded Alternation within P

[BibT_eX]

[DOI]

Stephen A. Bloch

Electron. Colloquium Comput. Complex., 1996

L-Printable Sets.

[BibT_eX]

[DOI]

Lance Fortnow

Stephen R. Mahaney

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1994

How hard are n2-hard problems?

[BibT_eX]

[DOI]

Stephen A. Bloch

SIGACT News, 1994

1993

Using Self-Reducibilities to Characterize Polynomial Time

[BibT_eX]

[DOI]

Paul Young

Inf. Comput., June, 1993

Nondeterminism Within P.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy.

[BibT_eX]

[DOI]

Paul Young

J. Comput. Syst. Sci., 1993

Relativized Isomorphisms of NP-Complete Sets.

[BibT_eX]

[DOI]

Comput. Complex., 1993

1992

Polynomial-Time Compression.

[BibT_eX]

[DOI]

Lane A. Hemachandra

Kenneth Kunen

Comput. Complex., 1992

1991

Near-Testable Sets.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Nondterminism Within P.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Lane A. Hemachandra

Kenneth Kunen

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1987

Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set.

[BibT_eX]

[DOI]

Paul Young

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

Three Results on the Polynomial Isomorphism of Complete Sets

[BibT_eX]

[DOI]