Latest in cs.gt
total 5730took 0.11s
Strategyproof Facility Location for Three AgentsFeb 21 2019We consider the facility location problem in metric space, focusing on the case of three agents. We show that selecting the reported location of each agent with probability proportional to the distance between the other two agents results in a mechanism ... More Minimal Envy and Popular MatchingsFeb 21 2019We study ex-post fairness in the object allocation problem where objects are valuable and commonly owned. A matching is fair from individual perspective if it has only inevitable envy towards agents who received most preferred objects -- minimal envy ... More Schelling Games on GraphsFeb 21 2019We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on an undirected graph. Agents can be either stubborn, in which case they ... More Rationals vs Byzantines in Consensus-based BlockchainsFeb 21 2019In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to model the Byzantine-consensus based blockchains as a committee coordination ... More The Hairy Ball Problem is PPAD-CompleteFeb 20 2019The Hairy Ball Theorem states that every continuous tangent vector field on an even-dimensional sphere must have a zero. We prove that the associated computational problem of computing an approximate zero is PPAD-complete. We also give a FIXP-hardness ... More Bayesian Exploration with Heterogeneous AgentsFeb 19 2019It is common in recommendation systems that users both consume and produce information as they make strategic choices under uncertainty. While a social planner would balance "exploration" and "exploitation" using a multi-armed bandit algorithm, users' ... More Stable fractional matchingsFeb 18 2019We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings ... More Limited Lookahead in Imperfect-Information GamesFeb 17 2019Limited lookahead has been studied for decades in complete-information games. We initiate a new direction via two simultaneous deviation points: generalization to incomplete-information games and a game-theoretic approach. We study how one should act ... More Robustness and Games Against Nature in Molecular ProgrammingFeb 16 2019Matter, especially DNA, is now programmed to carry out useful processes at the nanoscale. As these programs and processes become more complex and their envisioned safety-critical applications approach deployment, it is essential to develop methods for ... More Electing a committee with constraintsFeb 15 2019Feb 21 2019We consider the problem of electing a committee of $k$ candidates, subject to some constraints as to what this committee is supposed to look like. In our framework, the pool of candidates is divided into tribes, and constraints of the form "at least $p$ ... More Electing a committee with constraintsFeb 15 2019We consider the problem of electing a committee of $k$ candidates, subject to some constraints as to what this committee is supposed to look like. In our framework, the pool of candidates is divided into tribes, and constraints of the form "at least $p$ ... More A New Interaction Index inspired by the Taylor SeriesFeb 14 2019We study interactions among players in cooperative games. We propose a new interaction index called Shapley-Taylor interaction index. It decomposes the value of the game into terms that model the interactions between subsets of players, analogous to how ... More Stable-Predictive Optimistic Counterfactual Regret MinimizationFeb 13 2019The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to the Nash equilibrium is on the order of $O(T^{-1/2})$, where $T$ is the number ... More Optimal Budget-Feasible Mechanisms for Additive ValuationsFeb 12 2019In this paper, we obtain tight approximation guarantee for budget-feasible mechanisms with an additive buyer. We propose a new simple randomized mechanism with approximation ratio of $2$, improving the previous best known result of $3$. Our bound is tight ... More Security-Aware Synthesis Using Delayed-Action GamesFeb 12 2019Stochastic multiplayer games (SMGs) have gained attention in the field of strategy synthesis for multi-agent reactive systems. However, standard SMGs are limited to modeling systems where all agents have full knowledge of the state of the game. In this ... More The topology of Baumslag-Solitar representationsFeb 11 2019Let $\Gamma=\langle a,b | a b^{p} a^{-1} = b^{q}\rangle$ be a Baumslag--Solitar group and $G$ be a complex reductive algebraic group with maximal compact subgroup $K<G$. We show that, when $p$ and $q$ are relatively prime with distinct absolute values, ... More Mind the MiningFeb 11 2019In this paper we revisit the mining strategies in proof of work based cryptocurrencies and propose two strategies, we call smart and smarter mining, that in many cases strictly dominate honest mining. In contrast to other known attacks, like selfish mining, ... More Mind the MiningFeb 11 2019Feb 12 2019In this paper we revisit the mining strategies in proof of work based cryptocurrencies and propose two strategies, we call smart and smarter mining, that in many cases strictly dominate honest mining. In contrast to other known attacks, like selfish mining, ... More Learning Best Response Strategies for Agents in Ad ExchangesFeb 10 2019Ad exchanges are widely used in platforms for online display advertising. Autonomous agents operating in these exchanges must learn policies for interacting profitably with a diverse, continually changing, but unknown market. We consider this problem ... More Abelianisation of Logarithmic $\mathfrak{sl}_2$-ConnectionsFeb 09 2019We prove a functorial correspondence between a category of logarithmic $\mathfrak{sl}_2$-connections on a curve $X$ with fixed generic residues and a category of abelian logarithmic connections on an appropriate spectral double cover $\pi : \Sigma \to ... More Discovering Context Effects from Raw Choice DataFeb 08 2019Many applications in preference learning assume that decisions come from the maximization of a stable utility function. Yet a large experimental literature shows that individual choices and judgements can be affected by "irrelevant" aspects of the context ... More Expressive mechanisms for equitable rent division on a budgetFeb 08 2019We design envy-free mechanisms for the allocation of rooms and rent payments among roommates. We achieve four objectives: (1) each agent is allowed to make a report that expresses her preference about violating her budget constraint, a feature not achieved ... More Implementation of a Port-graph Model for FinanceFeb 06 2019In this paper we examine the process involved in the design and implementation of a port-graph model to be used for the analysis of an agent-based rational negligence model. Rational negligence describes the phenomenon that occurred during the financial ... More AlphaStar: An Evolutionary Computation PerspectiveFeb 05 2019In January 2019, DeepMind revealed AlphaStar to the world-the first artificial intelligence (AI) system to beat a professional player at the game of StarCraft II-representing a milestone in the progress of AI. AlphaStar draws on many areas of AI research, ... More (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value ProbingFeb 04 2019Feb 06 2019Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge $e$ exists, we need to perform an expensive test, in which case the edge $e$ appears independently with a \emph{known} probability $p_e$. ... More Fair Online AdvertisingJan 29 2019Online advertising platforms are thriving due to the customizable audiences they offer advertisers. However, recent studies show that the audience an ad gets shown to can be discriminatory with respect to sensitive attributes such as gender or ethnicity, ... More Committee Selection with Attribute Level PreferencesJan 29 2019Approval ballot based committee formation is concerned with aggregating individual approvals of voters. Voters submit their approvals of candidates and these approvals are aggregated to arrive at the optimal committee of specified size. There are several ... More Double-Auction Mechanisms for Resource Trading MarketJan 27 2019We consider a double-auction mechanism, which was recently proposed in the context of a mobile data-offloading market. It is also applicable in a network slicing market. Network operators (users) derive benefit from offloading their traffic to third party ... More Optimal Bribery in VotingJan 25 2019Studying complexity of various bribery problems has been one of the main research focus in computational social choice. In all the models of bribery studied so far, the briber has to pay every voter some amount of money depending on what the briber wants ... More Almost Envy-Freeness in Group Resource AllocationJan 24 2019We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair allocations under different assumptions on the valuations of the agents. ... More Open-ended Learning in Symmetric Zero-sum GamesJan 23 2019Zero-sum games such as chess and poker are, abstractly, functions that evaluate pairs of agents, for example labeling them `winner' and `loser'. If the game is approximately transitive, then self-play generates sequences of agents of increasing strength. ... More Knowing the past improves cooperation in the futureJan 22 2019Cooperation is the cornerstone of human evolutionary success. Like no other species, we champion the sacrifice of personal benefits for the common good, and we work together to achieve what we are unable to achieve alone. Knowledge and information from ... More Spectrum Sharing between DSRC and WiFi: A Repeated Game ApproachJan 22 2019Jan 25 2019We model the coexistence of Dedicated Short Range Communications (DSRC) and WiFi networks, when they access a shared wireless medium, as a repeated game. Both the networks use a similar CSMA/CA like medium access mechanism. However, while a DSRC network ... More Learning-Based Synthesis of Safety ControllersJan 21 2019We propose a machine learning framework to synthesize reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration, two-player games over (potentially) infinite graphs. Our framework targets safety ... More Approval-Based Elections and Distortion of Voting RulesJan 20 2019We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one that minimizes ... More Computing large market equilibria using abstractionsJan 18 2019Computing market equilibria is an important practical problem for market design (e.g. fair division, item allocation). However, computing equilibria requires large amounts of information (e.g. all valuations for all buyers for all items) and compute power. ... More Decomposition of games: some strategic considerationsJan 18 2019Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and non-strategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a game-theoretical ... More Telescopic groups and symmetries of combinatorial mapsJan 17 2019In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given automorphism group. This enhances the already known ... More Model and Algorithm for Time-Consistent Risk-Aware Markov GamesJan 15 2019In this paper, we propose a model for non-cooperative Markov games with time-consistent risk-aware players. In particular, our model characterizes the risk arising from both the stochastic state transitions and the randomized strategies of the other players. ... More Self-Stabilization Through the Lens of Game TheoryJan 15 2019In 1974 E.W. Dijkstra introduced the seminal concept of self-stabilization that turned out to be one of the main approaches to fault-tolerant computing. We show here how his three solutions can be formalized and reasoned about using the concepts of game ... More Optimal Strategies of Blotto Games: Beyond ConvexityJan 14 2019The Colonel Blotto game, first introduced by Borel in 1921, is a well-studied game theory classic. Two colonels each have a pool of troops that they divide simultaneously among a set of battlefields. The winner of each battlefield is the colonel who puts ... More Spherical orthotomic curve-germsJan 14 2019In this paper, it is shown that for an $n$-dimensional spherical unit speed curve $\gamma: I\to S^n$, a given point $P \in S^n$ and a point $s_0$ of the open interval $I$, the spherical orthotomic curve-germ $ort_{\gamma, P}: (I, s_0)\to S^n$ of $\gamma$ ... More Mitigating Jamming Attacks Using Energy HarvestingJan 11 2019The use of energy harvesting as a counter-jamming measure is investigated on the premise that part of the harmful interference can be harvested to increase the transmit power. We formulate the strategic interaction between a pair of legitimate nodes and ... More Intrinsic linking and knotting in tournamentsJan 11 2019A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where each pair of ... More Price of Anarchy in Algorithmic Matching of Romantic PartnersJan 08 2019Algorithmic-matching sites offer users access to an unprecedented number of potential mates. However, they also pose a principal-agent problem with a potential moral hazard. The agent's interest is to maximize usage of the Web site, while the principal's ... More Towards Thwarting Social Engineering AttacksJan 03 2019Social engineering attacks represent an increasingly important attack vector growing in use by sophisticated hackers to compromise organizations. Water-hole attacks, in particular, have been leveraged in many recent high profile hacks. These attacks compromise ... More Responsive Equilibrium for Self-Adaptive Ubiquitous InteractionDec 31 2018This work attempts to unify two domains: the Game Theory for cooperative control systems and the Responsive Web Design, under the umbrella of crowdsourcing for information gain on Ubiquous Sytems related to different devices (as PC, Tablet, Mobile,...) ... More Approximately Optimal Mechanism DesignDec 31 2018Optimal mechanism design enjoys a beautiful and well-developed theory, and also a number of killer applications. Rules of thumb produced by the field influence everything from how governments sell wireless spectrum licenses to how the major search engines ... More Learning and Selfconfirming Equilibria in Network GamesDec 31 2018Consider a set of agents who play a network game repeatedly. Agents may not know the network. They may even be unaware that they are interacting with other agents in a network. Possibly, they just understand that their payoffs depend on an unknown state ... More Detecting Multiple Seller Collusive Shill BiddingDec 28 2018Shill bidding occurs when fake bids are introduced into an auction on the seller's behalf in order to artificially inflate the final price. This is typically achieved by the seller having friends bid in her auctions, or the seller controls multiple fake ... More Surveillance-Evasion games under uncertaintyDec 27 2018Surveillance-Evasion games are continuous path planning problems in which an evader chooses his trajectory to hinder the surveillance by an enemy observer. In the classical setting, both players are assumed to have full information about each other's ... More On the Distortion Value of the Elections with AbstentionDec 24 2018In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than $3$, even for simple metrics such as a line. In this study, we wish to answer the following ... More Algorithmic aspects of immersibility and embeddabilityDec 21 2018We analyze an algorithmic question about immersion theory: for which $m$, $n$, and $CAT=\mathbf{Diff}$ or $\mathbf{PL}$ is the question of whether an $m$-dimensional $CAT$-manifold is immersible in $\mathbb{R}^n$ decidable? As a corollary, we show that ... More Invariants of Spatial GraphsDec 20 2018This is a short review article on invariants of spatial graphs, written for "A Concise Encyclopedia of Knot Theory" (ed. Adams et. al.). The emphasis is on combinatorial and polynomial invariants of spatial graphs, including the Alexander polynomial, ... More 3-Manifold triangulations with small treewidthDec 13 2018Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth of a compact, connected 3-manifold $M$ defined by \[ \operatorname{tw}(M) = \min\{\operatorname{tw}(\Gamma(\mathcal{T})):\mathcal{T}~\text{is a ... More Profit and Strategic Analysis for MNO-MVNO PartnershipDec 13 2018We consider a mobile market driven by two Mobile Network Operators (MNOs) and a new competitor Mobile Virtual Network Operator (MVNO). The MNOs can partner with the entrant MVNO by leasing network resources; however, the MVNO can also rely on other technologies ... More Systoles of hyperbolic surfaces with big cyclic symmetryDec 13 2018We obtain the exact values of the systoles of these hyperbolic surfaces of genus $g$ with cyclic sysmetries of the maximum order and the next maximum order. Precisely: for genus $g$ hyperbolic surface with order $4g+2$ cyclic symmetry, the systole is ... More Schur Multipliers and Second Quandle HomologyDec 11 2018We define a map from second quandle homology to the Schur multiplier and examine its properties. Furthermore, we express the second homology of Alexander quandles in terms of exterior algebras. Additionally, we present a self-contained proof of its structure ... More Affine actions with Hitchin linear partDec 10 2018Properly discontinuous actions of a surface group by affine automorphisms of $\mathbb R^d$ were shown to exist by Danciger-Gueritaud-Kassel. We show, however, that if the linear part of an affine surface group action is in the Hitchin component, then ... More Optimal Dynamic Auctions are Virtual Welfare MaximizersDec 07 2018We are interested in the setting where a seller sells sequentially arriving items, one per period, via a dynamic auction. At the beginning of each period, each buyer draws a private valuation for the item to be sold in that period and this valuation is ... More Differentially Private Fair LearningDec 06 2018Feb 05 2019Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study of fair learning ... More