Latest in cs.gt
total 7527took 0.13s
Hotelling Games with Multiple Line FaultsJul 15 2019The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In this paper, we ... More Solving Mean-Payoff Games via Quasi DominionsJul 14 2019We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions ... More Coloring invariants of knots and links are often intractableJul 13 2019Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting homomorphisms ... More Asynchronous Majority Dynamics in Preferential Attachment TreesJul 12 2019We study information aggregation in networks where agents make binary decisions (labeled incorrect or correct). Agents initially form independent private beliefs about the better decision, which is correct with probability $1/2+\delta$. The dynamics we ... More Deep Learning-powered Iterative Combinatorial AuctionsJul 12 2019In this paper, we study the design of deep learning-powered iterative combinatorial auctions (ICAs). We build on the work by Brero et al. (2018), who have successfully integrated support vector regression (SVR) into the preference elicitation algorithm ... More On Relevant Equilibria in Reachability GamesJul 11 2019We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always exists a Nash equilibrium (NE) and a subgame perfect equilibrium (SPE). ... More Time-aware uniformization of winning strategiesJul 11 2019Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may help with actual ... More Proportional Dynamics in Exchange EconomiesJul 11 2019We study the Proportional Response dynamic in exchange economies, where each player starts with some amount of money and a good. Every day, the players bring one unit of their good and submit bids on goods they like, each good gets allocated in proportion ... More Optimal mechanisms with budget for user generated contentsJul 10 2019In this paper, we design gross product maximization mechanisms which incentivize users to upload high-quality contents on user-generated-content (UGC) websites. We show that, the proportional division mechanism, which is widely used in practice, can perform ... More A Little Charity Guarantees Almost Envy-FreenessJul 10 2019Jul 12 2019Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute $m$ goods to $n$ agents in a "fair" manner, where every agent has a valuation for each subset of goods. We assume general valuations. Envy-freeness ... More A Little Charity Guarantees Almost Envy-FreenessJul 10 2019Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute $m$ goods to $n$ agents in a "fair" manner, where every agent has a valuation for each subset of goods. We assume general valuations. Envy-freeness ... More Assortment planning for two-sided sequential matching marketsJul 10 2019Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension between recommending ... More The Ad Types ProblemJul 09 2019The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are $k$ types of nodes on one side (the ads), and an ordered set of nodes on the other side (the slots). The edge weight of an ad $i$ of type $\theta$ ... More Selling Information Through ConsultingJul 09 2019We consider a monopoly information holder selling information to a budget-constrained decision maker, who may benefit from the seller's information. The decision maker has a utility function that depends on his action and an uncertain state of the world. ... More The Secretary Recommendation ProblemJul 09 2019In this paper we revisit the basic variant of the classical secretary problem. We propose a new approach, in which we separate between an agent that evaluates the secretary performance and one that has to make the hiring decision. The evaluating agent ... More Approximately Stable Matchings with General ConstraintsJul 09 2019This paper focuses on two-sided matching where one side (a hospital or firm) is matched to the other side (a doctor or worker) so as to maximize a cardinal objective under general feasibility constraints. In a standard model, even though multiple doctors ... More Symmetries of Spatial Graphs in Homology SpheresJul 06 2019This paper explores the relationship between symmetries of spatial graphs in $S^3$ and symmetries of spatial graphs in homology $3$-spheres and other $3$-manifolds. We prove that for any $3$-connected graph $G$, an automorphism $\sigma$ is induced by ... More Adversarial Fault Tolerant Training for Deep Neural NetworksJul 06 2019Jul 09 2019Deep Learning Accelerators are prone to faults which manifest in the form of errors in Neural Networks. Fault Tolerance in Neural Networks is crucial in real-time safety critical applications requiring computation for long durations. Neural Networks with ... More Genetic Network Architecture SearchJul 05 2019We propose a method for learning the neural network architecture that based on Genetic Algorithm (GA). Our approach uses a genetic algorithm integrated with standard Stochastic Gradient Descent(SGD) which allows the sharing of weights across all architecture ... More Fair Division through Information WithholdingJul 04 2019Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods that addresses pairwise envy by the removal of at most one good. In the worst case, each pair of agents might require the (hypothetical) removal of a different ... More Borel invariant for Zimmer cocycles of 3-manifold groupsJul 04 2019Let $\Gamma$ be a non-uniform lattice of $\text{PSL}(2,\mathbb{C})$. Given any representation $\rho:\Gamma \rightarrow \text{PSL}(n,\mathbb{C})$ we can define a numerical invariant $\beta_n(\rho)$, called Borel invariant, which remains constant along ... More Pricing in Resource Allocation Games Based on Duality GapsJul 03 2019We consider a basic resource allocation game, where the players' strategy spaces are subsets of $\mathbb{R}^m$ and cost/utility functions are parameterized by some common vector $u$ and, otherwise, only depend on the own strategy choice. A strategy of ... More Algorithms for Competitive Division of ChoresJul 03 2019We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities, when money transfers are not allowed. The competitive rule is known to be the best mechanism for goods with additive utilities and was recently extended ... More Simplicial complexity of surface groups and systolic areaJul 02 2019The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of the systolic ... More Adapting Stable Matchings to Evolving PreferencesJul 02 2019Adaptivity to changing environments and constraints is key to success in modern society. We address this view by proposing "incrementalized versions" of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, ... More Energy mean-payoff gamesJul 02 2019In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first player (the protagonist) ... More Incomplete Preferences in Single-Peaked ElectoratesJul 01 2019Incomplete preferences are likely to arise in real-world preference aggregation scenarios. This paper deals with determining whether an incomplete preference profile is single-peaked. This is valuable information since many intractable voting problems ... More Bayesian Generalized Network DesignJun 30 2019We study network coordination problems, as captured by the setting of generalized network design (Emek et al., STOC 2018), in the face of uncertainty resulting from partial information that the network users hold regarding the actions of their peers. ... More N-Person Discrete-Time Dynamic Games of Asymmetric InformationJun 30 2019This paper considers a class of N-person discrete-time dynamic games with an asymmetric information structure. Each player has private information revealed only to himself, which is modeled as a random variable called the type. Each player aims to find ... More Stable Matchings in Divorce GraphsJun 28 2019In this paper, we study the Reaching Stable Marriage via Divorce Operations problem, which given a Stable Marriage instance and an initial matching, asks whether a stable matching for the instance is reachable by a sequence of divorce operations as introduced ... More Stable Matchings in Divorce GraphsJun 28 2019Jul 02 2019In this paper, we study the Reaching Stable Marriage via Divorce Operations problem, which given a Stable Marriage instance and an initial matching, asks whether a stable matching for the instance is reachable by a sequence of divorce operations as introduced ... More Truly Concurrent Bisimilarities are Game EquivalentJun 27 2019We design games for truly concurrent bisimilarities, including strongly truly concurrent bisimilarities and branching truly concurrent bisimilarities, such as pomset bisimilarities, step bisimilarities, history-preserving bisimilarities and hereditary ... More The Complexity of Black-Box Mechanism Design with PriorsJun 26 2019We study black-box reductions from mechanism design to algorithm design for welfare maximization in settings of incomplete information. Given oracle access to an algorithm for an underlying optimization problem, the goal is to simulate an incentive compatible ... More A Compact, Logical Approach to Large-Market AnalysisJun 25 2019In game theory, we often use infinite models to represent "limit" settings, such as markets with a large number of agents or games with a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that, while introduced for simplicity, ... More The dual-process approach to human sociality: A reviewJun 24 2019Which social decisions are intuitive? Which are deliberative? The dual-process approach to human sociality has emerged in the last decades as a vibrant and exciting area of research. Here, I review the existing literature on the cognitive basis of cooperation, ... More Online Revenue Maximization for Server PricingJun 24 2019Efficient and truthful mechanisms to price resources on remote servers/machines has been the subject of much work in recent years due to the importance of the cloud market. This paper considers revenue maximization in the online stochastic setting with ... More Foolproof Cooperative LearningJun 24 2019This paper extends the notion of equilibrium in game theory to learning algorithms in repeated stochastic games. We define a learning equilibrium as an algorithm used by a population of players, such that no player can individually use an alternative ... More Single-crossing ImplementationJun 23 2019An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive properties: e.g., ... More Reinforcement Learning with Convex ConstraintsJun 21 2019In standard reinforcement learning (RL), a learning agent seeks to optimize the overall reward. However, many key aspects of a desired behavior are more naturally expressed as constraints. For instance, the designer may want to limit the use of unsafe ... More Individual Fairness in Sponsored Search AuctionsJun 20 2019Fairness in advertising is a topic of particular interest in both the computer science and economics literatures, supported by theoretical and empirical observations. We initiate the study of tradeoffs between individual fairness and performance in online ... More Near-optimal Reinforcement Learning using Bayesian QuantilesJun 20 2019We study model-based reinforcement learning in finite communicating Markov Decision Process. Algorithms in this settings have been developed in two different ways: the first view, which typically provides frequentist performance guarantees, uses optimism ... More The Complexity of Online Bribery in Sequential ElectionsJun 19 2019Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in sequentially, ... More Weighted Maxmin Fair Share Allocation of Indivisible ChoresJun 18 2019We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly ... More On the Tractability of Public Persuasion with No ExternalitiesJun 18 2019Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large body of algorithmic ... More On the Existence of Pareto Efficient and Envy Free AllocationsJun 17 2019Envy-freeness and Pareto Efficiency are two major goals in welfare economics. The existence of an allocation that satisfies both conditions has been studied for a long time. Whether items are indivisible or divisible, it is impossible to achieve envy-freeness ... More Protecting Elections by Recounting BallotsJun 17 2019Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in favor of a ... More Solution of Two-Player Zero-Sum Game by Successive RelaxationJun 16 2019We consider the problem of two-player zero-sum game. In this setting, there are two agents working against each other. Both the agents observe the same state and the objective of the agents is to compute a strategy profile that maximizes their rewards. ... More Social Cost Guarantees in Smart Route GuidanceJun 15 2019We model and study the problem of assigning traffic in an urban road network infrastructure. In our model, each driver submits their intended destination and is assigned a route to follow that minimizes the social cost (i.e., travel distance of all the ... More Learning in Cournot Games with Limited Information FeedbackJun 15 2019In this work, we study the interaction of strategic players in continuous action Cournot games with limited information feedback. Cournot game is the essential market model for many socio-economic systems where players learn and compete without the full ... More Report-Sensitive Spot-Checking in Peer-Grading SystemsJun 13 2019Peer grading systems make large courses more scalable, provide students with faster and more detailed feedback, and help students to learn by thinking critically about the work of others. A key obstacle to the broader adoption of peer grading is motivating ... More Competing Bandits in Matching MarketsJun 12 2019Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive online markets powered by data-driven matching platforms, it has become necessary ... More Estimation of the Shapley value by ergodic samplingJun 12 2019The idea of approximating the Shapley value of an n-person game by random sampling was introduced by Castro et al. (2009) and further improved by Maleki et al. (2013) and Castro et al. (2017) using stratification. In contrast to their independent sampling ... More Competing (Semi)-Selfish Miners in BitcoinJun 11 2019The Bitcoin protocol prescribes certain behavior by the miners who are responsible for maintaining and extending the underlying blockchain; in particular, miners who successfully solve a puzzle, and hence can extend the chain by a block, are supposed ... More The Demand Query Model for Bipartite MatchingJun 10 2019We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching seem to be ... More