paper_id string | title string | paper_url string | pdf_url string | authors list | abstract large_string | track string | primary_area string | doi string | volume string | issue string | pages string | abstract_source string | arxiv_id string | arxiv_id_source string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
10.1609/aaai.v35i6.16689 | Fair and Efficient Allocations under Lexicographic Preferences | https://ojs.aaai.org/index.php/AAAI/article/view/16689 | https://ojs.aaai.org/index.php/AAAI/article/download/16689/16496 | [
"Hadi Hosseini",
"Sujoy Sikdar",
"Rohit Vaish",
"Lirong Xia"
] | Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods. But whether such allocations always exist or whether they can be efficiently computed remains an important open question. We study the existence and computation of EFX in conjunction with var... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16689 | 35 | 6 | 5472-5480 | official | 2012.07680 | title_snapshot |
10.1609/aaai.v35i6.16690 | Necessarily Optimal One-Sided Matchings | https://ojs.aaai.org/index.php/AAAI/article/view/16690 | https://ojs.aaai.org/index.php/AAAI/article/download/16690/16497 | [
"Hadi Hosseini",
"Vijay Menon",
"Nisarg Shah",
"Sujoy Sikdar"
] | We study the classical problem of matching n agents to n objects, where the agents have ranked preferences over the objects. We focus on two popular desiderata from the matching literature: Pareto optimality and rank-maximality. Instead of asking the agents to report their complete preferences, our goal is to learn a d... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16690 | 35 | 6 | 5481-5488 | official | 2007.09079 | title_snapshot |
10.1609/aaai.v35i6.16691 | Computing the Proportional Veto Core | https://ojs.aaai.org/index.php/AAAI/article/view/16691 | https://ojs.aaai.org/index.php/AAAI/article/download/16691/16498 | [
"Egor Ianovski",
"Aleksei Y. Kondratev"
] | In social choice there often arises a conflict between the majority principle (the search for a candidate that is as good as possible for as many voters as possible), and the protection of minority rights (choosing a candidate that is not overly bad for particular individuals or groups). In a context where the latter i... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16691 | 35 | 6 | 5489-5496 | official | 2003.09153 | title_snapshot |
10.1609/aaai.v35i6.16692 | Multi-Scale Games: Representing and Solving Games on Networks with Group Structure | https://ojs.aaai.org/index.php/AAAI/article/view/16692 | https://ojs.aaai.org/index.php/AAAI/article/download/16692/16499 | [
"Kun Jin",
"Yevgeniy Vorobeychik",
"Mingyan Liu"
] | Network games provide a natural machinery to compactly represent strategic interactions among agents whose payoffs exhibit sparsity in their dependence on the actions of others. Besides encoding interaction sparsity, however, real networks often exhibit a multi-scale structure, in which agents can be grouped into commu... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16692 | 35 | 6 | 5497-5505 | official | 2101.08314 | title_snapshot |
10.1609/aaai.v35i6.16693 | Multi-Party Campaigning | https://ojs.aaai.org/index.php/AAAI/article/view/16693 | https://ojs.aaai.org/index.php/AAAI/article/download/16693/16500 | [
"Martin Koutecký",
"Nimrod Talmon"
] | We study a social choice setting of manipulation in elections and extend the usual model in two major ways: first, instead of considering a single manipulating agent, in our setting there are several, possibly competing ones; second, instead of evaluating an election after the first manipulative action, we allow severa... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16693 | 35 | 6 | 5506-5513 | official | 2005.04455 | title_snapshot |
10.1609/aaai.v35i6.16694 | Classification with Strategically Withheld Data | https://ojs.aaai.org/index.php/AAAI/article/view/16694 | https://ojs.aaai.org/index.php/AAAI/article/download/16694/16501 | [
"Anilesh K. Krishnaswamy",
"Haoming Li",
"David Rein",
"Hanrui Zhang",
"Vincent Conitzer"
] | Machine learning techniques can be useful in applications such as credit approval and college admission. However, to be classified more favorably in such contexts, an agent may decide to strategically withhold some of her features, such as bad test scores. This is a missing data problem with a twist: which data is miss... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16694 | 35 | 6 | 5514-5522 | official | 2012.10203 | title_snapshot |
10.1609/aaai.v35i6.16695 | On the PTAS for Maximin Shares in an Indivisible Mixed Manna | https://ojs.aaai.org/index.php/AAAI/article/view/16695 | https://ojs.aaai.org/index.php/AAAI/article/download/16695/16502 | [
"Rucha Kulkarni",
"Ruta Mehta",
"Setareh Taki"
] | We study fair allocation of indivisible items, both goods and chores, under the popular fairness notion of maximin share (MMS). The problem is well-studied when there are only goods (or chores), where a PTAS to compute the MMS values of agents is well-known. In contrast, for the mixed manna, a recent result showed that... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16695 | 35 | 6 | 5523-5530 | official | null | null |
10.1609/aaai.v35i6.16696 | Evolution Strategies for Approximate Solution of Bayesian Games | https://ojs.aaai.org/index.php/AAAI/article/view/16696 | https://ojs.aaai.org/index.php/AAAI/article/download/16696/16503 | [
"Zun Li",
"Michael P. Wellman"
] | We address the problem of solving complex Bayesian games, characterized by high-dimensional type and action spaces, many (> 2) players, and general-sum payoffs. Our approach applies to symmetric one-shot Bayesian games, with no given analytic structure. We represent agent strategies in parametric form as neural network... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16696 | 35 | 6 | 5531-5540 | official | null | null |
10.1609/aaai.v35i6.16697 | Safe Search for Stackelberg Equilibria in Extensive-Form Games | https://ojs.aaai.org/index.php/AAAI/article/view/16697 | https://ojs.aaai.org/index.php/AAAI/article/download/16697/16504 | [
"Chun Kai Ling",
"Noam Brown"
] | Stackelberg equilibrium is a solution concept in two-player games where the leader has commitment rights over the follower. In recent years, it has become a cornerstone of many security applications, including airport patrolling and wildlife poaching prevention. Even though many of these settings are sequential in natu... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16697 | 35 | 6 | 5541-5548 | official | 2102.01775 | title_snapshot |
10.1609/aaai.v35i6.16698 | Budget Feasible Mechanisms Over Graphs | https://ojs.aaai.org/index.php/AAAI/article/view/16698 | https://ojs.aaai.org/index.php/AAAI/article/download/16698/16505 | [
"Xiang Liu",
"Weiwei Wu",
"Minming Li",
"Wanyuan Wang"
] | This paper studies the budget-feasible mechanism design over graphs, where a buyer wishes to procure items from sellers, and all participants (the buyer and sellers) can only directly interact with their neighbors during the auction campaign. The problem for the buyer is to use the limited budget to incentivize sellers... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16698 | 35 | 6 | 5549-5556 | official | null | null |
10.1609/aaai.v35i6.16699 | On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games | https://ojs.aaai.org/index.php/AAAI/article/view/16699 | https://ojs.aaai.org/index.php/AAAI/article/download/16699/16506 | [
"Zhengyang Liu",
"Jiawei Li",
"Xiaotie Deng"
] | A polymatrix game is a multi-player game over n players, where each player chooses a pure strategy from a list of its own pure strategies. The utility of each player is a sum of payoffs it gains from the two player's game from all its neighbors, under its chosen strategy and that of its neighbor. As a natural extension... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16699 | 35 | 6 | 5557-5565 | official | null | null |
10.1609/aaai.v35i6.16700 | Trembling-Hand Perfection and Correlation in Sequential Games | https://ojs.aaai.org/index.php/AAAI/article/view/16700 | https://ojs.aaai.org/index.php/AAAI/article/download/16700/16507 | [
"Alberto Marchesi",
"Nicola Gatti"
] | We initiate the study of trembling-hand perfection in sequential (i.e., extensive-form) games with correlation. We introduce the extensive-form perfect correlated equilibrium (EFPCE) as a refinement of the classical extensive-form correlated equilibrium (EFCE) that amends its weaknesses off the equilibrium path. This i... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16700 | 35 | 6 | 5566-5574 | official | 2012.06528 | title_snapshot |
10.1609/aaai.v35i6.16701 | Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games | https://ojs.aaai.org/index.php/AAAI/article/view/16701 | https://ojs.aaai.org/index.php/AAAI/article/download/16701/16508 | [
"David Milec",
"Jakub Černý",
"Viliam Lisý",
"Bo An"
] | Solution concepts of traditional game theory assume entirely rational players; therefore, their ability to exploit subrational opponents is limited. One type of subrationality that describes human behavior well is the quantal response. While there exist algorithms for computing solutions against quantal opponents, they... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16701 | 35 | 6 | 5575-5583 | official | 2009.14521 | title_snapshot |
10.1609/aaai.v35i6.16702 | Hindsight and Sequential Rationality of Correlated Play | https://ojs.aaai.org/index.php/AAAI/article/view/16702 | https://ojs.aaai.org/index.php/AAAI/article/download/16702/16509 | [
"Dustin Morrill",
"Ryan D'Orazio",
"Reca Sarfati",
"Marc Lanctot",
"James R Wright",
"Amy R Greenwald",
"Michael Bowling"
] | Driven by recent successes in two-player, zero-sum game solving and playing, artificial intelligence work on games has increasingly focused on algorithms that produce equilibrium-based strategies. However, this approach has been less effective at producing competent players in general-sum games or those with more than ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16702 | 35 | 6 | 5584-5594 | official | 2012.05874 | title_snapshot |
10.1609/aaai.v35i6.16685 | Fair and Efficient Online Allocations with Normalized Valuations | https://ojs.aaai.org/index.php/AAAI/article/view/16685 | https://ojs.aaai.org/index.php/AAAI/article/download/16685/16492 | [
"Vasilis Gkatzelis",
"Alexandros Psomas",
"Xizhi Tan"
] | A set of divisible resources becomes available over a sequence of rounds and needs to be allocated immediately and irrevocably. Our goal is to distribute these resources to maximize fairness and efficiency. Achieving any non-trivial guarantees in an adversarial setting is impossible. However, we show that normalizing t... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16685 | 35 | 6 | 5440-5447 | official | 2009.12405 | title_snapshot |
10.1609/aaai.v35i6.16684 | Infinite-Dimensional Fisher Markets: Equilibrium, Duality and Optimization | https://ojs.aaai.org/index.php/AAAI/article/view/16684 | https://ojs.aaai.org/index.php/AAAI/article/download/16684/16491 | [
"Yuan Gao",
"Christian Kroer"
] | This paper considers a linear Fisher market with n buyers and a continuum of items. In order to compute market equilibria, we introduce (infinite-dimensional) convex programs over Banach spaces, thereby generalizing the Eisenberg-Gale convex program and its dual. Regarding the new convex programs, we establish existenc... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16684 | 35 | 6 | 5432-5439 | official | null | null |
10.1609/aaai.v35i6.16683 | Efficient Truthful Scheduling and Resource Allocation through Monitoring | https://ojs.aaai.org/index.php/AAAI/article/view/16683 | https://ojs.aaai.org/index.php/AAAI/article/download/16683/16490 | [
"Dimitris Fotakis",
"Piotr Krysta",
"Carmine Ventre"
] | We study the power and limitations of the Vickrey-Clarke-Groves mechanism with monitoring (VCGmon) for cost minimization problems with objective functions that are more general than the social cost. We identify a simple and natural sufficient condition for VCGmon to be truthful for general objectives. As a consequence,... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16683 | 35 | 6 | 5423-5431 | official | null | null |
10.1609/aaai.v35i6.16663 | Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry | https://ojs.aaai.org/index.php/AAAI/article/view/16663 | https://ojs.aaai.org/index.php/AAAI/article/download/16663/16470 | [
"Matteo Castiglioni",
"Andrea Celli",
"Alberto Marchesi",
"Nicola Gatti"
] | Network congestion games are a well-understood model of multi-agent strategic interactions. Despite their ubiquitous applications, it is not clear whether it is possible to design information structures to ameliorate the overall experience of the network users. We focus on Bayesian games with atomic players, where netw... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16663 | 35 | 6 | 5252-5259 | official | 2002.05190 | title_snapshot |
10.1609/aaai.v35i6.16664 | Computing Quantal Stackelberg Equilibrium in Extensive-Form Games | https://ojs.aaai.org/index.php/AAAI/article/view/16664 | https://ojs.aaai.org/index.php/AAAI/article/download/16664/16471 | [
"Jakub Černý",
"Viliam Lisý",
"Branislav Bošanský",
"Bo An"
] | Deployments of game-theoretic solution concepts in the real world have highlighted the necessity to consider human opponents' boundedly rational behavior. If subrationality is not addressed, the system can face significant losses in terms of expected utility. While there exist algorithms for computing optimal strategie... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16664 | 35 | 6 | 5260-5268 | official | null | null |
10.1609/aaai.v35i6.16665 | Fair and Efficient Allocations under Subadditive Valuations | https://ojs.aaai.org/index.php/AAAI/article/view/16665 | https://ojs.aaai.org/index.php/AAAI/article/download/16665/16472 | [
"Bhaskar Ray Chaudhury",
"Jugal Garg",
"Ruta Mehta"
] | We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most compelling notion of fairness in the context of indivisible goods. Although the existence of EFX is not known beyond the simple case of tw... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16665 | 35 | 6 | 5269-5276 | official | 2005.06511 | title_snapshot |
10.1609/aaai.v35i6.16666 | Scalable Equilibrium Computation in Multi-agent Influence Games on Networks | https://ojs.aaai.org/index.php/AAAI/article/view/16666 | https://ojs.aaai.org/index.php/AAAI/article/download/16666/16473 | [
"Fotini Christia",
"Michael Curry",
"Constantinos Daskalakis",
"Erik Demaine",
"John P. Dickerson",
"MohammadTaghi Hajiaghayi",
"Adam Hesterberg",
"Marina Knittel",
"Aidan Milliff"
] | We provide a polynomial-time, scalable algorithm for equilibrium computation in multi-agent influence games on networks, extending work of Bindel, Kleinberg, and Oren (2015) from the single-agent to the multi-agent setting. In games of influence, agents have limited advertising budget to influence the initial predispos... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16666 | 35 | 6 | 5277-5285 | official | null | null |
10.1609/aaai.v35i6.16667 | Proportional Representation under Single-Crossing Preferences Revisited | https://ojs.aaai.org/index.php/AAAI/article/view/16667 | https://ojs.aaai.org/index.php/AAAI/article/download/16667/16474 | [
"Andrei Costin Constantinescu",
"Edith Elkind"
] | We study the complexity of determining a winning committee under the Chamberlin-Courant voting rule when voters' preferences are single-crossing on a line, or, more generally, on a tree. For the line, Skowron et al. (2015) describe an O(n^2mk) algorithm (where n, m, k are the number of voters, the number of candidates ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16667 | 35 | 6 | 5286-5293 | official | 2010.08637 | title_snapshot |
10.1609/aaai.v35i6.16668 | Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable | https://ojs.aaai.org/index.php/AAAI/article/view/16668 | https://ojs.aaai.org/index.php/AAAI/article/download/16668/16475 | [
"Sina Dehghani",
"Hamed Saleh",
"Saeed Seddighin",
"Shang-Hua Teng"
] | In the classical discrete Colonel Blotto game—introduced by Borel in 1921—two colonels simultaneously distribute their troops across multiple battlefields. The winner of each battlefield is determined by a winner-take-all rule, independently of other battlefields. In the original formulation, each colonel’s goal is to ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16668 | 35 | 6 | 5294-5302 | official | null | null |
10.1609/aaai.v35i6.16669 | Model-sharing Games: Analyzing Federated Learning Under Voluntary Participation | https://ojs.aaai.org/index.php/AAAI/article/view/16669 | https://ojs.aaai.org/index.php/AAAI/article/download/16669/16476 | [
"Kate Donahue",
"Jon Kleinberg"
] | Federated learning is a setting where agents, each with access to their own data source, combine models learned from local data to create a global model. If agents are drawing their data from different distributions, though, federated learning might produce a biased global model that is not optimal for each agent. This... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16669 | 35 | 6 | 5303-5311 | official | 2010.00753 | title_snapshot |
10.1609/aaai.v35i6.16670 | On Fair Division under Heterogeneous Matroid Constraints | https://ojs.aaai.org/index.php/AAAI/article/view/16670 | https://ojs.aaai.org/index.php/AAAI/article/download/16670/16477 | [
"Amitay Dror",
"Michal Feldman",
"Erel Segal-Halevi"
] | We study fair allocation of indivisible goods among additive agents with feasibility constraints. In these settings, every agent is restricted to get a bundle among a specified set of feasible bundles. Such scenarios have been of great interest to the AI community due to their applicability to real-world problems. Foll... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16670 | 35 | 6 | 5312-5320 | official | 2010.07280 | title_snapshot |
10.1609/aaai.v35i6.16671 | PoA of Simple Auctions with Interdependent Values | https://ojs.aaai.org/index.php/AAAI/article/view/16671 | https://ojs.aaai.org/index.php/AAAI/article/download/16671/16478 | [
"Alon Eden",
"Michal Feldman",
"Inbal Talgam-Cohen",
"Ori Zviran"
] | We expand the literature on the price of anarchy (PoA) of simultaneous item auctions by considering settings with correlated values; we do this via the fundamental economic model of interdependent values (IDV). It is well-known that in multi-item settings with private values, correlated values can lead to bad PoA, whic... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16671 | 35 | 6 | 5321-5329 | official | 2011.00498 | title_judge |
10.1609/aaai.v35i6.16672 | Mind the Gap: Cake Cutting With Separation | https://ojs.aaai.org/index.php/AAAI/article/view/16672 | https://ojs.aaai.org/index.php/AAAI/article/download/16672/16479 | [
"Edith Elkind",
"Erel Segal-Halevi",
"Warut Suksompong"
] | We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an additional requirement that the shares that different agents receive should be sufficiently separated from one another. This captures, for example, constraints arising from social distancing guidelines. While it is somet... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16672 | 35 | 6 | 5330-5338 | official | 2012.06682 | title_snapshot |
10.1609/aaai.v35i6.16674 | Incentivizing Truthfulness Through Audits in Strategic Classification | https://ojs.aaai.org/index.php/AAAI/article/view/16674 | https://ojs.aaai.org/index.php/AAAI/article/download/16674/16481 | [
"Andrew Estornell",
"Sanmay Das",
"Yevgeniy Vorobeychik"
] | In many societal resource allocation domains, machine learning methods are increasingly used to either score or rank agents in order to decide which ones should receive either resources (e.g., homeless services) or scrutiny (e.g., child welfare investigations) from social services agencies. An agency's scoring function... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16674 | 35 | 6 | 5347-5354 | official | 2012.09147 | title_snapshot |
10.1609/aaai.v35i6.16675 | Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings | https://ojs.aaai.org/index.php/AAAI/article/view/16675 | https://ojs.aaai.org/index.php/AAAI/article/download/16675/16482 | [
"Alireza Farhadi",
"MohammadTaghi Hajiaghayi",
"Mohamad Latifian",
"Masoud Seddighin",
"Hadi Yami"
] | Envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In sharp contrast, it is unknown whether or not an EFX allocation always exist... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16675 | 35 | 6 | 5355-5362 | official | 2007.07027 | title_snapshot |
10.1609/aaai.v35i6.16676 | Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent | https://ojs.aaai.org/index.php/AAAI/article/view/16676 | https://ojs.aaai.org/index.php/AAAI/article/download/16676/16483 | [
"Gabriele Farina",
"Christian Kroer",
"Tuomas Sandholm"
] | Blackwell approachability is a framework for reasoning about repeated games with vector-valued payoffs. We introduce predictive Blackwell approachability, where an estimate of the next payoff vector is given, and the decision maker tries to achieve better performance based on the accuracy of that estimator. In order to... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16676 | 35 | 6 | 5363-5371 | official | 2007.14358 | title_snapshot |
10.1609/aaai.v35i6.16677 | Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games | https://ojs.aaai.org/index.php/AAAI/article/view/16677 | https://ojs.aaai.org/index.php/AAAI/article/download/16677/16484 | [
"Gabriele Farina",
"Robin Schmucker",
"Tuomas Sandholm"
] | Tree-form sequential decision making (TFSDM) extends classical one-shot decision making by modeling tree-form interactions between an agent and a potentially adversarial environment. It captures the online decision-making problems that each player faces in an extensive-form game, as well as Markov decision processes an... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16677 | 35 | 6 | 5372-5380 | official | 2103.04546 | title_snapshot |
10.1609/aaai.v35i6.16678 | Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games | https://ojs.aaai.org/index.php/AAAI/article/view/16678 | https://ojs.aaai.org/index.php/AAAI/article/download/16678/16485 | [
"Gabriele Farina",
"Tuomas Sandholm"
] | Regret minimization has proved to be a versatile tool for tree-form sequential decision making and extensive-form games. In large two-player zero-sum imperfect-information games, modern extensions of counterfactual regret minimization (CFR) are currently the practical state of the art for computing a Nash equilibrium. ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16678 | 35 | 6 | 5381-5390 | official | 2103.04539 | title_snapshot |
10.1609/aaai.v35i6.16679 | Simultaneous 2nd Price Item Auctions with No-Underbidding | https://ojs.aaai.org/index.php/AAAI/article/view/16679 | https://ojs.aaai.org/index.php/AAAI/article/download/16679/16486 | [
"Michal Feldman",
"Galia Shabtai"
] | We study the price of anarchy (PoA) of simultaneous 2nd price auctions (S2PA) under a new natural condition of no underbidding, meaning that agents never bid on items less than their marginal values. We establish improved (mostly tight) bounds on the PoA of S2PA under no underbidding for different valuation classes (in... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16679 | 35 | 6 | 5391-5398 | official | 2003.11857 | title_snapshot |
10.1609/aaai.v35i6.16680 | Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions | https://ojs.aaai.org/index.php/AAAI/article/view/16680 | https://ojs.aaai.org/index.php/AAAI/article/download/16680/16487 | [
"Zhe Feng",
"Guru Guruganesh",
"Christopher Liaw",
"Aranyak Mehta",
"Abhishek Sethi"
] | The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play no-regret strategies, this produces a sequence of actions whose time-average is a coarse-correlated equilibrium of the game. However, much less is known about equilibrium s... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16680 | 35 | 6 | 5399-5406 | official | 2009.06136 | title_snapshot |
10.1609/aaai.v35i6.16681 | Condorcet Relaxation In Spatial Voting | https://ojs.aaai.org/index.php/AAAI/article/view/16681 | https://ojs.aaai.org/index.php/AAAI/article/download/16681/16488 | [
"Arnold Filtser",
"Omrit Filtser"
] | Consider a set of voters V, represented by a multiset in a metric space (X,d). The voters have to reach a decision - a point in X. A choice p∈ X is called a β-plurality point for V, if for any other choice q∈ X it holds that |{v∈ V ∣ β⋅ d(p,v)≤ d(q,v)}| ≥|V|/2 . In other words, at least half of the voters ``prefer'' ov... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16681 | 35 | 6 | 5407-5414 | official | null | null |
10.1609/aaai.v35i6.16682 | Present-Biased Optimization | https://ojs.aaai.org/index.php/AAAI/article/view/16682 | https://ojs.aaai.org/index.php/AAAI/article/download/16682/16489 | [
"Fedor V. Fomin",
"Pierre Fraigniaud",
"Petr A. Golovach"
] | This paper explores the behavior of present-biased agents, that is, agents who erroneously anticipate the costs of future actions compared to their real costs. Specifically, the paper extends the origi- nal framework proposed by Akerlof (1991) for studying various aspects of human behavior related to time-inconsistent ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16682 | 35 | 6 | 5415-5422 | official | 2012.14736 | title_snapshot |
10.1609/aaai.v35i6.16673 | United for Change: Deliberative Coalition Formation to Change the Status Quo | https://ojs.aaai.org/index.php/AAAI/article/view/16673 | https://ojs.aaai.org/index.php/AAAI/article/download/16673/16480 | [
"Edith Elkind",
"Davide Grossi",
"Ehud Shapiro",
"Nimrod Talmon"
] | We study a setting in which a community wishes to identify a strongly supported proposal from a large space of alternatives, in order to change the status quo. We describe a deliberation process in which agents dynamically form coalitions around proposals that they prefer over the status quo. We formulate conditions on... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16673 | 35 | 6 | 5339-5346 | official | 2001.08031 | title_snapshot |
10.1609/aaai.v35i6.16652 | Dividing a Graphical Cake | https://ojs.aaai.org/index.php/AAAI/article/view/16652 | https://ojs.aaai.org/index.php/AAAI/article/download/16652/16459 | [
"Xiaohui Bei",
"Warut Suksompong"
] | We consider the classical cake-cutting problem where we wish to fairly divide a heterogeneous resource, often modeled as a cake, among interested agents. Work on the subject typically assumes that the cake is represented by an interval. In this paper, we introduce a generalized setting where the cake can be in the form... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16652 | 35 | 6 | 5159-5166 | official | 1910.14129 | title_snapshot |
10.1609/aaai.v35i6.16657 | Preserving Condorcet Winners under Strategic Manipulation | https://ojs.aaai.org/index.php/AAAI/article/view/16657 | https://ojs.aaai.org/index.php/AAAI/article/download/16657/16464 | [
"Sirin Botan",
"Ulle Endriss"
] | Condorcet extensions have long held a prominent place in social choice theory. A Condorcet extension will return the Condorcet winner as the unique winner whenever such an alternative exists. However, the definition of a Condorcet extension does not take into account possible manipulation by the voters. A profile where... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16657 | 35 | 6 | 5202-5210 | official | null | null |
10.1609/aaai.v35i6.16651 | The Price of Connectivity in Fair Division | https://ojs.aaai.org/index.php/AAAI/article/view/16651 | https://ojs.aaai.org/index.php/AAAI/article/download/16651/16458 | [
"Xiaohui Bei",
"Ayumi Igarashi",
"Xinhang Lu",
"Warut Suksompong"
] | We study the allocation of indivisible goods that form an undirected graph and quantify the loss of fairness when we impose a constraint that each agent must receive a connected subgraph. Our focus is on the well-studied fairness notion of maximin share fairness. We introduce the price of connectivity to capture the la... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16651 | 35 | 6 | 5151-5158 | official | 1908.05433 | title_snapshot |
10.1609/aaai.v35i6.16650 | Achieving Proportionality up to the Maximin Item with Indivisible Goods | https://ojs.aaai.org/index.php/AAAI/article/view/16650 | https://ojs.aaai.org/index.php/AAAI/article/download/16650/16457 | [
"Artem Baklanov",
"Pranav Garimidi",
"Vasilis Gkatzelis",
"Daniel Schoepflin"
] | We study the problem of fairly allocating indivisible goods and focus on the classic fairness notion of proportionality. The indivisibility of the goods is long known to pose highly non-trivial obstacles to achieving fairness, and a very vibrant line of research has aimed to circumvent them using appropriate notions of... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16650 | 35 | 6 | 5143-5150 | official | 2009.09508 | title_snapshot |
10.1609/aaai.v35i6.16649 | Defending against Contagious Attacks on a Network with Resource Reallocation | https://ojs.aaai.org/index.php/AAAI/article/view/16649 | https://ojs.aaai.org/index.php/AAAI/article/download/16649/16456 | [
"Rufan Bai",
"Haoxing Lin",
"Xinyu Yang",
"Xiaowei Wu",
"Minming Li",
"Weijia Jia"
] | In classic network security games, the defender distributes defending resources to the nodes of the network, and the attacker attacks a node, with the objective to maximize the damage caused. Existing models assume that the attack at node u causes damage only at u. However, in many real-world security scenarios, the at... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16649 | 35 | 6 | 5135-5142 | official | 2012.01036 | title_snapshot |
10.1609/aaai.v35i6.16648 | Bayesian Persuasion under Ex Ante and Ex Post Constraints | https://ojs.aaai.org/index.php/AAAI/article/view/16648 | https://ojs.aaai.org/index.php/AAAI/article/download/16648/16455 | [
"Yakov Babichenko",
"Inbal Talgam-Cohen",
"Konstantin Zabarnyi"
] | Bayesian persuasion, as introduced by Kamenica and Gentzkow in 2011, is the study of information sharing policies among strategic agents. A prime example is signaling in online ad auctions: what information should a platform signal to an advertiser regarding a user when selling the opportunity to advertise to her? Prac... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16648 | 35 | 6 | 5127-5134 | official | 2012.03272 | title_snapshot |
10.1609/aaai.v35i6.16647 | Fair and Truthful Mechanisms for Dichotomous Valuations | https://ojs.aaai.org/index.php/AAAI/article/view/16647 | https://ojs.aaai.org/index.php/AAAI/article/download/16647/16454 | [
"Moshe Babaioff",
"Tomer Ezra",
"Uriel Feige"
] | We consider the problem of allocating a set on indivisible items to players with private preferences in an efficient and fair way. We focus on valuations that have dichotomous marginals, in which the added value of any item to a set is either 0 or 1, and aim to design truthful allocation mechanisms (without money) that... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16647 | 35 | 6 | 5119-5126 | official | 2002.10704 | title_snapshot |
10.1609/aaai.v35i6.16646 | Proportionally Representative Participatory Budgeting with Ordinal Preferences | https://ojs.aaai.org/index.php/AAAI/article/view/16646 | https://ojs.aaai.org/index.php/AAAI/article/download/16646/16453 | [
"Haris Aziz",
"Barton E. Lee"
] | Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric weights. We propose proportional representation axioms and clarify how they fit... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16646 | 35 | 6 | 5110-5118 | official | 1911.00864 | title_snapshot |
10.1609/aaai.v35i6.16645 | Achieving Envy-freeness and Equitability with Monetary Transfers | https://ojs.aaai.org/index.php/AAAI/article/view/16645 | https://ojs.aaai.org/index.php/AAAI/article/download/16645/16452 | [
"Haris Aziz"
] | When allocating indivisible resources or tasks, an envy-free allocation or equitable allocation may not exist. We present a sufficient condition and an algorithm to achieve envy-freeness and equitability when monetary transfers are allowed. The approach works for any agent valuation functions (positive or negative) as ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16645 | 35 | 6 | 5102-5109 | official | 2003.08125 | title_snapshot |
10.1609/aaai.v35i6.16644 | Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs) | https://ojs.aaai.org/index.php/AAAI/article/view/16644 | https://ojs.aaai.org/index.php/AAAI/article/download/16644/16451 | [
"Elliot Anshelevich",
"Wennan Zhu"
] | We study a coordination game motivated by the formation of Internet Exchange Points (IXPs), in which agents choose which facilities to join. Joining the same facility as other agents you communicate with has benefits, but different facilities have different costs for each agent. Thus, the players wish to join the same ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16644 | 35 | 6 | 5094-5101 | official | 2008.12235 | title_snapshot |
10.1609/aaai.v35i6.16643 | Representative Proxy Voting | https://ojs.aaai.org/index.php/AAAI/article/view/16643 | https://ojs.aaai.org/index.php/AAAI/article/download/16643/16450 | [
"Elliot Anshelevich",
"Zack Fitzsimmons",
"Rohit Vaish",
"Lirong Xia"
] | We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the closest proxy. The goal is to find a set of proxies that is theta-representative, which entails that for any voter located anywhere on the lin... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16643 | 35 | 6 | 5086-5093 | official | 2012.06747 | title_snapshot |
10.1609/aaai.v35i6.16653 | Maximin Fairness with Mixed Divisible and Indivisible Goods | https://ojs.aaai.org/index.php/AAAI/article/view/16653 | https://ojs.aaai.org/index.php/AAAI/article/download/16653/16460 | [
"Xiaohui Bei",
"Shengxin Liu",
"Xinhang Lu",
"Hongao Wang"
] | We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on the well-studied fairness notion of maximin share fairness (MMS). With only indivisible goods, a full MMS allocation may not exist, but a constant multiplicative approximate allocation always does. We ... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16653 | 35 | 6 | 5167-5175 | official | 2002.05245 | title_snapshot |
10.1609/aaai.v35i6.16654 | Protecting the Protected Group: Circumventing Harmful Fairness | https://ojs.aaai.org/index.php/AAAI/article/view/16654 | https://ojs.aaai.org/index.php/AAAI/article/download/16654/16461 | [
"Omer Ben-Porat",
"Fedor Sandomirskiy",
"Moshe Tennenholtz"
] | The recent literature on fair Machine Learning manifests that the choice of fairness constraints must be driven by the utilities of the population. However, virtually all previous work makes the unrealistic assumption that the exact underlying utilities of the population (representing private tastes of individuals) are... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16654 | 35 | 6 | 5176-5184 | official | 1905.10546 | title_snapshot |
10.1609/aaai.v35i6.16655 | Selfish Creation of Social Networks | https://ojs.aaai.org/index.php/AAAI/article/view/16655 | https://ojs.aaai.org/index.php/AAAI/article/download/16655/16462 | [
"Davide Bilò",
"Tobias Friedrich",
"Pascal Lenzner",
"Stefanie Lowski",
"Anna Melnichenko"
] | Understanding real-world networks is a core research endeavor within the last two decades. Network Creation Games are a promising approach for this from a game-theoretic perspective. In these games, selfish agents corresponding to nodes in a network strategically decide which links to form to optimize their centrality.... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16655 | 35 | 6 | 5185-5193 | official | 2012.06203 | title_snapshot |
10.1609/aaai.v35i6.16656 | On the Complexity of Finding Justifications for Collective Decisions | https://ojs.aaai.org/index.php/AAAI/article/view/16656 | https://ojs.aaai.org/index.php/AAAI/article/download/16656/16463 | [
"Arthur Boixel",
"Ronald De Haan"
] | In a collective decision-making process, having the possibility to provide non-expert agents with a justification for why a target outcome is a good compromise given their individual preferences, is an appealing idea. Such questions have recently been addressed in the computational social choice community at large---wh... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16656 | 35 | 6 | 5194-5201 | official | null | null |
10.1609/aaai.v35i6.16658 | Reaching Individually Stable Coalition Structures in Hedonic Games | https://ojs.aaai.org/index.php/AAAI/article/view/16658 | https://ojs.aaai.org/index.php/AAAI/article/download/16658/16465 | [
"Felix Brandt",
"Martin Bullinger",
"Anaëlle Wilczynski"
] | The formal study of coalition formation in multiagent systems is typically realized using so-called hedonic games, which originate from economic theory. The main focus of this branch of research has been on the existence and the computational complexity of deciding the existence of coalition structures that satisfy var... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16658 | 35 | 6 | 5211-5218 | official | null | null |
10.1609/aaai.v35i6.16659 | Reinforcement Learning of Sequential Price Mechanisms | https://ojs.aaai.org/index.php/AAAI/article/view/16659 | https://ojs.aaai.org/index.php/AAAI/article/download/16659/16466 | [
"Gianluca Brero",
"Alon Eden",
"Matthias Gerstgrasser",
"David Parkes",
"Duncan Rheingans-Yoo"
] | We introduce the use of reinforcement learning for indirect mechanisms, working with the existing class of sequential price mechanisms, which generalizes both serial dictatorship and posted price mechanisms and essentially characterizes all strongly obviously strategyproof mechanisms. Learning an optimal mechanism with... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16659 | 35 | 6 | 5219-5227 | official | 2010.01180 | title_snapshot |
10.1609/aaai.v35i6.16660 | Margin of Victory in Tournaments: Structural and Experimental Results | https://ojs.aaai.org/index.php/AAAI/article/view/16660 | https://ojs.aaai.org/index.php/AAAI/article/download/16660/16467 | [
"Markus Brill",
"Ulrike Schmidt-Kraepelin",
"Warut Suksompong"
] | Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives. The recently studied notion of margin of victory (MoV) offers a general method for refining the winner set of any given tournament solution, thereby increasing the discriminative power of the so... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16660 | 35 | 6 | 5228-5235 | official | 2012.02657 | title_snapshot |
10.1609/aaai.v35i6.16661 | Welfare Guarantees in Schelling Segregation | https://ojs.aaai.org/index.php/AAAI/article/view/16661 | https://ojs.aaai.org/index.php/AAAI/article/download/16661/16468 | [
"Martin Bullinger",
"Warut Suksompong",
"Alexandros A. Voudouris"
] | Schelling's model is an influential model that reveals how individual perceptions and incentives can lead to racial segregation. Inspired by a recent stream of work, we study welfare guarantees and complexity in this model with respect to several welfare measures. First, we show that while maximizing the social welfare... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16661 | 35 | 6 | 5236-5243 | official | 2012.02086 | title_snapshot |
10.1609/aaai.v35i6.16662 | Persuading Voters in District-based Elections | https://ojs.aaai.org/index.php/AAAI/article/view/16662 | https://ojs.aaai.org/index.php/AAAI/article/download/16662/16469 | [
"Matteo Castiglioni",
"Nicola Gatti"
] | We focus on the scenario in which an agent can exploit his information advantage to manipulate the outcome of an election. In particular, we study district-based elections with two candidates, in which the winner of the election is the candidate that wins in the majority of the districts. District-based elections are a... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16662 | 35 | 6 | 5244-5251 | official | 2012.05002 | title_snapshot |
10.1609/aaai.v35i6.16641 | Double Oracle Algorithm for Computing Equilibria in Continuous Games | https://ojs.aaai.org/index.php/AAAI/article/view/16641 | https://ojs.aaai.org/index.php/AAAI/article/download/16641/16448 | [
"Lukáš Adam",
"Rostislav Horčík",
"Tomáš Kasl",
"Tomáš Kroupa"
] | Many efficient algorithms have been designed to recover Nash equilibria of various classes of finite games. Special classes of continuous games with infinite strategy spaces, such as polynomial games, can be solved by semidefinite programming. In general, however, continuous games are not directly amenable to computati... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16641 | 35 | 6 | 5070-5077 | official | 2009.12185 | title_snapshot |
10.1609/aaai.v35i6.16642 | A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching | https://ojs.aaai.org/index.php/AAAI/article/view/16642 | https://ojs.aaai.org/index.php/AAAI/article/download/16642/16449 | [
"Georgios Amanatidis",
"Georgios Birmpas",
"Aris Filos-Ratsikas",
"Alexandros A. Voudouris"
] | We consider the one-sided matching problem, where n agents have preferences over n items, and these preferences are induced by underlying cardinal valuation functions. The goal is to match every agent to a single item so as to maximize the social welfare. Most of the related literature, however, assumes that the values... | main | Game Theory and Economic Paradigms | 10.1609/aaai.v35i6.16642 | 35 | 6 | 5078-5085 | official | 2009.06543 | title_snapshot |
10.1609/aaai.v35i7.16730 | Learning from Crowds by Modeling Common Confusions | https://ojs.aaai.org/index.php/AAAI/article/view/16730 | https://ojs.aaai.org/index.php/AAAI/article/download/16730/16537 | [
"Zhendong Chu",
"Jing Ma",
"Hongning Wang"
] | Crowdsourcing provides a practical way to obtain large amounts of labeled data at a low cost. However, the annotation quality of annotators varies considerably, which imposes new challenges in learning a high-quality model from the crowdsourced annotations. In this work, we provide a new perspective to decompose annota... | main | Human-Computation and Crowd Sourcing | 10.1609/aaai.v35i7.16730 | 35 | 7 | 5832-5840 | official | 2012.13052 | title_snapshot |
10.1609/aaai.v35i7.16731 | Time to Transfer: Predicting and Evaluating Machine-Human Chatting Handoff | https://ojs.aaai.org/index.php/AAAI/article/view/16731 | https://ojs.aaai.org/index.php/AAAI/article/download/16731/16538 | [
"Jiawei Liu",
"Zhe Gao",
"Yangyang Kang",
"Zhuoren Jiang",
"Guoxiu He",
"Changlong Sun",
"Xiaozhong Liu",
"Wei Lu"
] | Is chatbot able to completely replace the human agent? The short answer could be – ``it depends...''. For some challenging cases, e.g., dialogue's topical spectrum spreads beyond the training corpus coverage, the chatbot may malfunction and return unsatisfied utterances. This problem can be addressed by introducing the... | main | Human-Computation and Crowd Sourcing | 10.1609/aaai.v35i7.16731 | 35 | 7 | 5841-5849 | official | 2012.07610 | title_snapshot |
10.1609/aaai.v35i7.16732 | Teaching Active Human Learners | https://ojs.aaai.org/index.php/AAAI/article/view/16732 | https://ojs.aaai.org/index.php/AAAI/article/download/16732/16539 | [
"Zizhe Wang",
"Hailong Sun"
] | Teaching humans is an important topic under the umbrella of machine teaching, and its core problem is to design an algorithm for selecting teaching examples. Existing work typically regards humans as passive learners, where an ordered set of teaching examples are generated and fed to learners sequentially. However, suc... | main | Human-Computation and Crowd Sourcing | 10.1609/aaai.v35i7.16732 | 35 | 7 | 5850-5857 | official | null | null |
10.1609/aaai.v35i7.16743 | Contrastive Adversarial Learning for Person Independent Facial Emotion Recognition | https://ojs.aaai.org/index.php/AAAI/article/view/16743 | https://ojs.aaai.org/index.php/AAAI/article/download/16743/16550 | [
"Daeha Kim",
"Byung Cheol Song"
] | Since most facial emotion recognition (FER) methods significantly rely on supervision information, they have a limit to analyzing emotions independently of persons. On the other hand, adversarial learning is a well-known approach for generalized representation learning because it never requires supervision information.... | main | Humans and AI | 10.1609/aaai.v35i7.16743 | 35 | 7 | 5948-5956 | official | null | null |
10.1609/aaai.v35i7.16753 | Inferring Emotion from Large-scale Internet Voice Data: A Semi-supervised Curriculum Augmentation based Deep Learning Approach | https://ojs.aaai.org/index.php/AAAI/article/view/16753 | https://ojs.aaai.org/index.php/AAAI/article/download/16753/16560 | [
"Suping Zhou",
"Jia Jia",
"Zhiyong Wu",
"Zhihan Yang",
"Yanfeng Wang",
"Wei Chen",
"Fanbo Meng",
"Shuo Huang",
"Jialie Shen",
"Xiaochuan Wang"
] | Effective emotion inference from user queries helps to give a more personified response for Voice Dialogue Applications(VDAs). The tremendous amounts of VDA users bring in diverse emotion expressions. How to achieve a high emotion inferring performance from large-scale Internet Voice Data in VDAs? Traditionally, resear... | main | Humans and AI | 10.1609/aaai.v35i7.16753 | 35 | 7 | 6039-6047 | official | null | null |
10.1609/aaai.v35i7.16752 | A Continual Learning Framework for Uncertainty-Aware Interactive Image Segmentation | https://ojs.aaai.org/index.php/AAAI/article/view/16752 | https://ojs.aaai.org/index.php/AAAI/article/download/16752/16559 | [
"Ervine Zheng",
"Qi Yu",
"Rui Li",
"Pengcheng Shi",
"Anne Haake"
] | Deep learning models have achieved state-of-the-art performance in semantic image segmentation, but the results provided by fully automatic algorithms are not always guaranteed satisfactory to users. Interactive segmentation offers a solution by accepting user annotations on selective areas of the images to refine the ... | main | Humans and AI | 10.1609/aaai.v35i7.16752 | 35 | 7 | 6030-6038 | official | null | null |
10.1609/aaai.v35i7.16751 | Content Learning with Structure-Aware Writing: A Graph-Infused Dual Conditional Variational Autoencoder for Automatic Storytelling | https://ojs.aaai.org/index.php/AAAI/article/view/16751 | https://ojs.aaai.org/index.php/AAAI/article/download/16751/16558 | [
"Meng-Hsuan Yu",
"Juntao Li",
"Zhangming Chan",
"Rui Yan",
"Dongyan Zhao"
] | Recent automatic storytelling methods mainly rely on keyword planning or plot skeleton generation to model long-range dependencies and create consistent narrative texts. However, these approaches generate story plans or plots sequentially, leaving the non-sequential conception and structural design processes of human w... | main | Humans and AI | 10.1609/aaai.v35i7.16751 | 35 | 7 | 6021-6029 | official | null | null |
10.1609/aaai.v35i7.16750 | Bounded Risk-Sensitive Markov Games: Forward Policy Design and Inverse Reward Learning with Iterative Reasoning and Cumulative Prospect Theory | https://ojs.aaai.org/index.php/AAAI/article/view/16750 | https://ojs.aaai.org/index.php/AAAI/article/download/16750/16557 | [
"Ran Tian",
"Liting Sun",
"Masayoshi Tomizuka"
] | Classical game-theoretic approaches for multi-agent systems in both the forward policy design problem and the inverse reward learning problem often make strong rationality assumptions: agents perfectly maximize expected utilities under uncertainties. Such assumptions, however, substantially mismatch with observed human... | main | Humans and AI | 10.1609/aaai.v35i7.16750 | 35 | 7 | 6011-6020 | official | 2009.01495 | title_snapshot |
10.1609/aaai.v35i7.16749 | Learning Rewards From Linguistic Feedback | https://ojs.aaai.org/index.php/AAAI/article/view/16749 | https://ojs.aaai.org/index.php/AAAI/article/download/16749/16556 | [
"Theodore R. Sumers",
"Mark K. Ho",
"Robert D. Hawkins",
"Karthik Narasimhan",
"Thomas L. Griffiths"
] | We explore unconstrained natural language feedback as a learning signal for artificial agents. Humans use rich and varied language to teach, yet most prior work on interactive learning from language assumes a particular form of input (e.g., commands). We propose a general framework which does not make this assumption, ... | main | Humans and AI | 10.1609/aaai.v35i7.16749 | 35 | 7 | 6002-6010 | official | 2009.14715 | title_snapshot |
10.1609/aaai.v35i7.16748 | Uncertain Graph Neural Networks for Facial Action Unit Detection | https://ojs.aaai.org/index.php/AAAI/article/view/16748 | https://ojs.aaai.org/index.php/AAAI/article/download/16748/16555 | [
"Tengfei Song",
"Lisha Chen",
"Wenming Zheng",
"Qiang Ji"
] | Capturing the dependencies among different facial action units (AU) is extremely important for the AU detection task. Many studies have employed graph-based deep learning methods to exploit the dependencies among AUs. However, the dependencies among AUs in real world data are often noisy and the uncertainty is essentia... | main | Humans and AI | 10.1609/aaai.v35i7.16748 | 35 | 7 | 5993-6001 | official | null | null |
10.1609/aaai.v35i7.16747 | Narrative Plan Generation with Self-Supervised Learning | https://ojs.aaai.org/index.php/AAAI/article/view/16747 | https://ojs.aaai.org/index.php/AAAI/article/download/16747/16554 | [
"Mihai Polceanu",
"Julie Porteous",
"Alan Lindsay",
"Marc Cavazza"
] | Narrative Generation has attracted significant interest as a novel application of Automated Planning techniques. However, the vast amount of narrative material available opens the way to the use of Deep Learning techniques. In this paper, we explore the feasibility of narrative generation through self-supervised learni... | main | Humans and AI | 10.1609/aaai.v35i7.16747 | 35 | 7 | 5984-5992 | official | null | null |
10.1609/aaai.v35i7.16746 | Indecision Modeling | https://ojs.aaai.org/index.php/AAAI/article/view/16746 | https://ojs.aaai.org/index.php/AAAI/article/download/16746/16553 | [
"Duncan C. McElfresh",
"Lok Chan",
"Kenzie Doyle",
"Walter Sinnott-Armstrong",
"Vincent Conitzer",
"Jana Schaich Borg",
"John P. Dickerson"
] | AI systems are often used to make or contribute to important decisions in a growing range of applications, including criminal justice, hiring, and medicine. Since these decisions impact human lives, it is important that the AI systems act in ways which align with human values. Techniques for preference modeling and soc... | main | Humans and AI | 10.1609/aaai.v35i7.16746 | 35 | 7 | 5975-5983 | official | 2012.08485 | title_snapshot |
10.1609/aaai.v35i7.16745 | Improving the Performance-Compatibility Tradeoff with Personalized Objective Functions | https://ojs.aaai.org/index.php/AAAI/article/view/16745 | https://ojs.aaai.org/index.php/AAAI/article/download/16745/16552 | [
"Jonathan Martinez",
"Kobi Gal",
"Ece Kamar",
"Levi H. S. Lelis"
] | AI-systems that model and interact with their users can up-date their models over time to reflect new information and changes in the environment. Although these updates may improve the overall performance of the AI-system, they may actually hurt the performance with respect to individual users. Prior work has studied t... | main | Humans and AI | 10.1609/aaai.v35i7.16745 | 35 | 7 | 5967-5974 | official | null | null |
10.1609/aaai.v35i7.16744 | AI-Assisted Scientific Data Collection with Iterative Human Feedback | https://ojs.aaai.org/index.php/AAAI/article/view/16744 | https://ojs.aaai.org/index.php/AAAI/article/download/16744/16551 | [
"Travis Mandel",
"James Boyd",
"Sebastian J. Carter",
"Randall H. Tanaka",
"Taishi Nammoto"
] | Although artificial intelligence has revolutionized data analysis, significantly less work has focused on using AI to improve scientific data collection. Past work in AI for data collection has typically assumed the objective function is well-defined by humans before starting an experiment; however, this is a poor fit ... | main | Humans and AI | 10.1609/aaai.v35i7.16744 | 35 | 7 | 5957-5966 | official | null | null |
10.1609/aaai.v35i7.16733 | Automated Storytelling via Causal, Commonsense Plot Ordering | https://ojs.aaai.org/index.php/AAAI/article/view/16733 | https://ojs.aaai.org/index.php/AAAI/article/download/16733/16540 | [
"Prithviraj Ammanabrolu",
"Wesley Cheung",
"William Broniec",
"Mark O. Riedl"
] | Automated story plot generation is the task of generating a coherent sequence of plot events. Causal relations between plot events are believed to increase the perception of story and plot coherence. In this work, we introduce the concept of soft causal relations as causal relations inferred from commonsense reasoning.... | main | Humans and AI | 10.1609/aaai.v35i7.16733 | 35 | 7 | 5859-5867 | official | 2009.00829 | title_snapshot |
10.1609/aaai.v35i7.16742 | Goal Blending for Responsive Shared Autonomy in a Navigating Vehicle | https://ojs.aaai.org/index.php/AAAI/article/view/16742 | https://ojs.aaai.org/index.php/AAAI/article/download/16742/16549 | [
"Yu-Sian Jiang",
"Garrett Warnell",
"Peter Stone"
] | Human-robot shared autonomy techniques for vehicle navigation hold promise for reducing a human driver’s workload, ensuring safety, and improving navigation efficiency. However, because typical techniques achieve these improvements by effectively removing human control at critical moments, these approaches often exhibi... | main | Humans and AI | 10.1609/aaai.v35i7.16742 | 35 | 7 | 5939-5947 | official | null | null |
10.1609/aaai.v35i7.16741 | ActionBert: Leveraging User Actions for Semantic Understanding of User Interfaces | https://ojs.aaai.org/index.php/AAAI/article/view/16741 | https://ojs.aaai.org/index.php/AAAI/article/download/16741/16548 | [
"Zecheng He",
"Srinivas Sunkara",
"Xiaoxue Zang",
"Ying Xu",
"Lijuan Liu",
"Nevan Wichers",
"Gabriel Schubiner",
"Ruby Lee",
"Jindong Chen"
] | As mobile devices are becoming ubiquitous, regularly interacting with a variety of user interfaces (UIs) is a common aspect of daily life for many people. To improve the accessibility of these devices and to enable their usage in a variety of settings, building models that can assist users and accomplish tasks through ... | main | Humans and AI | 10.1609/aaai.v35i7.16741 | 35 | 7 | 5931-5938 | official | 2012.12350 | title_snapshot |
10.1609/aaai.v35i7.16740 | Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network | https://ojs.aaai.org/index.php/AAAI/article/view/16740 | https://ojs.aaai.org/index.php/AAAI/article/download/16740/16547 | [
"Matthew C. Fontaine",
"Ruilin Liu",
"Ahmed Khalifa",
"Jignesh Modi",
"Julian Togelius",
"Amy K. Hoover",
"Stefanos Nikolaidis"
] | Generative adversarial networks (GANs) are quickly becoming a ubiquitous approach to procedurally generating video game levels. While GAN generated levels are stylistically similar to human-authored examples, human designers often want to explore the generative design space of GANs to extract interesting levels. Howeve... | main | Humans and AI | 10.1609/aaai.v35i7.16740 | 35 | 7 | 5922-5930 | official | 2007.05674 | title_snapshot |
10.1609/aaai.v35i7.16739 | Wasserstein Distributionally Robust Inverse Multiobjective Optimization | https://ojs.aaai.org/index.php/AAAI/article/view/16739 | https://ojs.aaai.org/index.php/AAAI/article/download/16739/16546 | [
"Chaosheng Dong",
"Bo Zeng"
] | Inverse multiobjective optimization provides a general framework for the unsupervised learning task of inferring parameters of a multiobjective decision making problem (DMP), based on a set of observed decisions from the human expert. However, the performance of this framework relies critically on the availability of a... | main | Humans and AI | 10.1609/aaai.v35i7.16739 | 35 | 7 | 5914-5921 | official | 2009.14552 | title_snapshot |
10.1609/aaai.v35i7.16738 | Classification Under Human Assistance | https://ojs.aaai.org/index.php/AAAI/article/view/16738 | https://ojs.aaai.org/index.php/AAAI/article/download/16738/16545 | [
"Abir De",
"Nastaran Okati",
"Ali Zarezade",
"Manuel Gomez Rodriguez"
] | Most supervised learning models are trained for full automation. However, their predictions are sometimes worse than those by human experts on some specific instances. Motivated by this empirical observation, our goal is to design classifiers that are optimized to operate under different automation levels. More specifi... | main | Humans and AI | 10.1609/aaai.v35i7.16738 | 35 | 7 | 5905-5913 | official | 2006.11845 | title_snapshot |
10.1609/aaai.v35i7.16737 | User Driven Model Adjustment via Boolean Rule Explanations | https://ojs.aaai.org/index.php/AAAI/article/view/16737 | https://ojs.aaai.org/index.php/AAAI/article/download/16737/16544 | [
"Elizabeth M. Daly",
"Massimiliano Mattetti",
"Öznur Alkan",
"Rahul Nair"
] | AI solutions are heavily dependant on the quality and accuracy of the input training data, however the training data may not always fully reflect the most up-to-date policy landscape or may be missing business logic. The advances in explainability have opened the possibility of allowing users to interact with interpret... | main | Humans and AI | 10.1609/aaai.v35i7.16737 | 35 | 7 | 5896-5904 | official | 2203.15071 | title_snapshot |
10.1609/aaai.v35i7.16736 | Learning to Sit: Synthesizing Human-Chair Interactions via Hierarchical Control | https://ojs.aaai.org/index.php/AAAI/article/view/16736 | https://ojs.aaai.org/index.php/AAAI/article/download/16736/16543 | [
"Yu-Wei Chao",
"Jimei Yang",
"Weifeng Chen",
"Jia Deng"
] | Recent progress on physics-based character animation has shown impressive breakthroughs on human motion synthesis, through imitating motion capture data via deep reinforcement learning. However, results have mostly been demonstrated on imitating a single distinct motion pattern, and do not generalize to interactive tas... | main | Humans and AI | 10.1609/aaai.v35i7.16736 | 35 | 7 | 5887-5895 | official | 1908.07423 | title_snapshot |
10.1609/aaai.v35i7.16735 | Human Uncertainty Inference via Deterministic Ensemble Neural Networks | https://ojs.aaai.org/index.php/AAAI/article/view/16735 | https://ojs.aaai.org/index.php/AAAI/article/download/16735/16542 | [
"Yujin Cha",
"Sang Wan Lee"
] | The estimation and inference of human predictive uncertainty have great potential to improve the sampling efficiency and prediction reliability of human-in-the-loop systems for smart healthcare, smart education, and human-computer interactions. Predictive uncertainty in humans is highly interpretable, but its measureme... | main | Humans and AI | 10.1609/aaai.v35i7.16735 | 35 | 7 | 5877-5886 | official | null | null |
10.1609/aaai.v35i7.16734 | MARTA: Leveraging Human Rationales for Explainable Text Classification | https://ojs.aaai.org/index.php/AAAI/article/view/16734 | https://ojs.aaai.org/index.php/AAAI/article/download/16734/16541 | [
"Ines Arous",
"Ljiljana Dolamic",
"Jie Yang",
"Akansha Bhardwaj",
"Giuseppe Cuccu",
"Philippe Cudré-Mauroux"
] | Explainability is a key requirement for text classification in many application domains ranging from sentiment analysis to medical diagnosis or legal reviews. Existing methods often rely on "attention" mechanisms for explaining classification results by estimating the relative importance of input units. However, recent... | main | Humans and AI | 10.1609/aaai.v35i7.16734 | 35 | 7 | 5868-5876 | official | null | null |
10.1609/aaai.v35i7.16763 | IDOL: Inertial Deep Orientation-Estimation and Localization | https://ojs.aaai.org/index.php/AAAI/article/view/16763 | https://ojs.aaai.org/index.php/AAAI/article/download/16763/16570 | [
"Scott Sun",
"Dennis Melamed",
"Kris Kitani"
] | Many smartphone applications use inertial measurement units (IMUs) to sense movement, but the use of these sensors for pedestrian localization can be challenging due to their noise characteristics. Recent data-driven inertial odometry approaches have demonstrated the increasing feasibility of inertial navigation. Howev... | main | Intelligent Robots | 10.1609/aaai.v35i7.16763 | 35 | 7 | 6128-6137 | official | 2102.04024 | title_snapshot |
10.1609/aaai.v35i7.16764 | Differentiable Fluids with Solid Coupling for Learning and Control | https://ojs.aaai.org/index.php/AAAI/article/view/16764 | https://ojs.aaai.org/index.php/AAAI/article/download/16764/16571 | [
"Tetsuya Takahashi",
"Junbang Liang",
"Yi-Ling Qiao",
"Ming C. Lin"
] | We introduce an efficient differentiable fluid simulator that can be integrated with deep neural networks as a part of layers for learning dynamics and solving control problems. It offers the capability to handle one-way coupling of fluids with rigid objects using a variational principle that naturally enforces necessa... | main | Intelligent Robots | 10.1609/aaai.v35i7.16764 | 35 | 7 | 6138-6146 | official | null | null |
10.1609/aaai.v35i7.16765 | CMAX++ : Leveraging Experience in Planning and Execution using Inaccurate Models | https://ojs.aaai.org/index.php/AAAI/article/view/16765 | https://ojs.aaai.org/index.php/AAAI/article/download/16765/16572 | [
"Anirudh Vemula",
"J. Andrew Bagnell",
"Maxim Likhachev"
] | Given access to accurate dynamical models, modern planning approaches are effective in computing feasible and optimal plans for repetitive robotic tasks. However, it is difficult to model the true dynamics of the real world before execution, especially for tasks requiring interactions with objects whose parameters are ... | main | Intelligent Robots | 10.1609/aaai.v35i7.16765 | 35 | 7 | 6147-6155 | official | 2009.09942 | title_snapshot |
10.1609/aaai.v35i7.16766 | Generative Partial Visual-Tactile Fused Object Clustering | https://ojs.aaai.org/index.php/AAAI/article/view/16766 | https://ojs.aaai.org/index.php/AAAI/article/download/16766/16573 | [
"Tao Zhang",
"Yang Cong",
"Gan Sun",
"Jiahua Dong",
"Yuyang Liu",
"Zhengming Ding"
] | Visual-tactile fused sensing for object clustering has achieved significant progresses recently, since the involvement of tactile modality can effectively improve clustering performance. However, the missing data (i.e., partial data) issues always happen due to occlusion and noises during the data collecting process. T... | main | Intelligent Robots | 10.1609/aaai.v35i7.16766 | 35 | 7 | 6156-6164 | official | 2012.14070 | title_snapshot |
10.1609/aaai.v35i7.16767 | VMLoc: Variational Fusion For Learning-Based Multimodal Camera Localization | https://ojs.aaai.org/index.php/AAAI/article/view/16767 | https://ojs.aaai.org/index.php/AAAI/article/download/16767/16574 | [
"Kaichen Zhou",
"Changhao Chen",
"Bing Wang",
"Muhamad Risqi U. Saputra",
"Niki Trigoni",
"Andrew Markham"
] | Recent learning-based approaches have achieved impressive results in the field of single-shot camera localization. However, how best to fuse multiple modalities (e.g., image and depth) and to deal with degraded or missing input are less well studied. In particular, we note that previous approaches towards deep fusion d... | main | Intelligent Robots | 10.1609/aaai.v35i7.16767 | 35 | 7 | 6165-6173 | official | 2003.07289 | title_snapshot |
10.1609/aaai.v35i7.16754 | Automatic Generation of Flexible Plans via Diverse Temporal Planning | https://ojs.aaai.org/index.php/AAAI/article/view/16754 | https://ojs.aaai.org/index.php/AAAI/article/download/16754/16561 | [
"Yotam Amitai",
"Ayal Taitler",
"Erez Karpas"
] | Robots operating in the real world must deal with uncertainty, be it due to working with humans who are unpredictable, or simply because they must operate in a dynamic environment. Ignoring the uncertainty is dangerous, while accounting for all possible outcomes is often computationally infeasible. One approach, which ... | main | Intelligent Robots | 10.1609/aaai.v35i7.16754 | 35 | 7 | 6049-6057 | official | null | null |
10.1609/aaai.v35i7.16755 | BT Expansion: a Sound and Complete Algorithm for Behavior Planning of Intelligent Robots with Behavior Trees | https://ojs.aaai.org/index.php/AAAI/article/view/16755 | https://ojs.aaai.org/index.php/AAAI/article/download/16755/16562 | [
"Zhongxuan Cai",
"Minglong Li",
"Wanrong Huang",
"Wenjing Yang"
] | Behavior Trees (BTs) have attracted much attention in the robotics field in recent years, which generalize existing control architectures and bring unique advantages for building robot systems. Automated synthesis of BTs can reduce human workload and build behavior models for complex tasks beyond the ability of human d... | main | Intelligent Robots | 10.1609/aaai.v35i7.16755 | 35 | 7 | 6058-6065 | official | null | null |
10.1609/aaai.v35i7.16756 | I3DOL: Incremental 3D Object Learning without Catastrophic Forgetting | https://ojs.aaai.org/index.php/AAAI/article/view/16756 | https://ojs.aaai.org/index.php/AAAI/article/download/16756/16563 | [
"Jiahua Dong",
"Yang Cong",
"Gan Sun",
"Bingtao Ma",
"Lichen Wang"
] | 3D object classification has attracted appealing attentions in academic researches and industrial applications. However, most existing methods need to access the training data of past 3D object classes when facing the common real-world scenario: new classes of 3D objects arrive in a sequence. Moreover, the performance ... | main | Intelligent Robots | 10.1609/aaai.v35i7.16756 | 35 | 7 | 6066-6074 | official | 2012.09014 | title_snapshot |
10.1609/aaai.v35i7.16757 | Enabling Fast Instruction-Based Modification of Learned Robot Skills | https://ojs.aaai.org/index.php/AAAI/article/view/16757 | https://ojs.aaai.org/index.php/AAAI/article/download/16757/16564 | [
"Tyler Frasca",
"Bradley Oosterveld",
"Meia Chita-Tegmark",
"Matthias Scheutz"
] | Much research effort in HRI has focused on how to enable robots to learn new skills from observations, demonstrations, and instructions. Less work, however, has focused on how skills can be corrected if they were learned incorrectly, adapted to changing circumstances, or generalized/specialized to different contexts. I... | main | Intelligent Robots | 10.1609/aaai.v35i7.16757 | 35 | 7 | 6075-6083 | official | null | null |
10.1609/aaai.v35i7.16758 | Consistent Right-Invariant Fixed-Lag Smoother with Application to Visual Inertial SLAM | https://ojs.aaai.org/index.php/AAAI/article/view/16758 | https://ojs.aaai.org/index.php/AAAI/article/download/16758/16565 | [
"Jianzhu Huai",
"Yukai Lin",
"Yuan Zhuang",
"Min Shi"
] | State estimation problems without absolute position measurements routinely arise in navigation of unmanned aerial vehicles, autonomous ground vehicles, etc., whose proper operation relies on accurate state estimates and reliable covariances. Unaware of absolute positions, these problems have immanent unobservable direc... | main | Intelligent Robots | 10.1609/aaai.v35i7.16758 | 35 | 7 | 6084-6092 | official | 2102.08596 | title_snapshot |
10.1609/aaai.v35i7.16759 | Supervised Training of Dense Object Nets using Optimal Descriptors for Industrial Robotic Applications | https://ojs.aaai.org/index.php/AAAI/article/view/16759 | https://ojs.aaai.org/index.php/AAAI/article/download/16759/16566 | [
"Andras Gabor Kupcsik",
"Markus Spies",
"Alexander Klein",
"Marco Todescato",
"Nicolai Waniek",
"Philipp Schillinger",
"Mathias Bürger"
] | Dense Object Nets (DONs) by Florence, Manuelli and Tedrake (2018) introduced dense object descriptors as a novel visual object representation for the robotics community. It is suitable for many applications including object grasping, policy learning, etc. DONs map an RGB image depicting an object into a descriptor spac... | main | Intelligent Robots | 10.1609/aaai.v35i7.16759 | 35 | 7 | 6093-6100 | official | 2102.08096 | title_snapshot |
10.1609/aaai.v35i7.16760 | DenserNet: Weakly Supervised Visual Localization Using Multi-Scale Feature Aggregation | https://ojs.aaai.org/index.php/AAAI/article/view/16760 | https://ojs.aaai.org/index.php/AAAI/article/download/16760/16567 | [
"Dongfang Liu",
"Yiming Cui",
"Liqi Yan",
"Christos Mousas",
"Baijian Yang",
"Yingjie Chen"
] | In this work, we introduce a Denser Feature Network(DenserNet) for visual localization. Our work provides three principal contributions. First, we develop a convolutional neural network (CNN) architecture which aggregates feature maps at different semantic levels for image representations. Using denser feature maps, ou... | main | Intelligent Robots | 10.1609/aaai.v35i7.16760 | 35 | 7 | 6101-6109 | official | 2012.02366 | title_snapshot |
10.1609/aaai.v35i7.16761 | Learning Intuitive Physics with Multimodal Generative Models | https://ojs.aaai.org/index.php/AAAI/article/view/16761 | https://ojs.aaai.org/index.php/AAAI/article/download/16761/16568 | [
"Sahand Rezaei-Shoshtari",
"Francois R. Hogan",
"Michael Jenkin",
"David Meger",
"Gregory Dudek"
] | Predicting the future interaction of objects when they come into contact with their environment is key for autonomous agents to take intelligent and anticipatory actions. This paper presents a perception framework that fuses visual and tactile feedback to make predictions about the expected motion of objects in dynamic... | main | Intelligent Robots | 10.1609/aaai.v35i7.16761 | 35 | 7 | 6110-6118 | official | 2101.04454 | title_snapshot |
10.1609/aaai.v35i7.16762 | SCAN: A Spatial Context Attentive Network for Joint Multi-Agent Intent Prediction | https://ojs.aaai.org/index.php/AAAI/article/view/16762 | https://ojs.aaai.org/index.php/AAAI/article/download/16762/16569 | [
"Jasmine Sekhon",
"Cody Fleming"
] | Safe navigation of autonomous agents in human centric environments requires the ability to understand and predict motion of neighboring pedestrians. However, predicting pedestrian intent is a complex problem. Pedestrian motion is governed by complex social navigation norms, is dependent on neighbors' trajectories and i... | main | Intelligent Robots | 10.1609/aaai.v35i7.16762 | 35 | 7 | 6119-6127 | official | 2102.00109 | title_snapshot |
10.1609/aaai.v35i7.16810 | Testing Independence Between Linear Combinations for Causal Discovery | https://ojs.aaai.org/index.php/AAAI/article/view/16810 | https://ojs.aaai.org/index.php/AAAI/article/download/16810/16617 | [
"Hao Zhang",
"Kun Zhang",
"Shuigeng Zhou",
"Jihong Guan",
"Ji Zhang"
] | Recently, regression based conditional independence (CI) tests have been employed to solve the problem of causal discovery. These methods provide an alternative way to test for CI by transforming CI to independence between residuals. Generally, it is nontrivial to check for independence when these residuals are linearl... | main | Knowledge Representation and Reasoning | 10.1609/aaai.v35i7.16810 | 35 | 7 | 6538-6546 | official | null | null |
10.1609/aaai.v35i7.16809 | On-the-fly Synthesis for LTL over Finite Traces | https://ojs.aaai.org/index.php/AAAI/article/view/16809 | https://ojs.aaai.org/index.php/AAAI/article/download/16809/16616 | [
"Shengping Xiao",
"Jianwen Li",
"Shufang Zhu",
"Yingying Shi",
"Geguang Pu",
"Moshe Vardi"
] | We present a new synthesis framework based on the on-the-fly DFA construction for LTL over finite traces (LTLf ). Extant approaches rely heavily on the construction of the complete DFA w.r.t. the input LTLf formula, whose size can be doubly exponential to the size of the formula in the worst case. Under those approache... | main | Knowledge Representation and Reasoning | 10.1609/aaai.v35i7.16809 | 35 | 7 | 6530-6537 | official | null | null |
10.1609/aaai.v35i7.16808 | Focused Inference and System P | https://ojs.aaai.org/index.php/AAAI/article/view/16808 | https://ojs.aaai.org/index.php/AAAI/article/download/16808/16615 | [
"Marco Wilhelm",
"Gabriele Kern-Isberner"
] | We bring in the concept of focused inference into the field of qualitative nonmonotonic reasoning by applying focused inference to System P. The idea behind drawing focused inferences is to concentrate on knowledge which seems to be relevant for answering a query while completely disregarding the remaining knowledge ev... | main | Knowledge Representation and Reasoning | 10.1609/aaai.v35i7.16808 | 35 | 7 | 6522-6529 | official | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.