Latest in

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
Probabilistic Smart Contracts: Secure Randomness on the BlockchainFeb 21 2019In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and ... 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
Fair cost allocation for ridesharing services - modeling, mathematical programming and an algorithm to find the nucleolusFeb 19 2019This paper addresses one of the most challenging issues in designing an efficient and sustainable ridesharing service: ridesharing market design. We formulate it as a fair cost allocation problem through the lens of the cooperative game theory. A special ... More
On approximate pure Nash equilibria in weighted congestion games with polynomial latenciesFeb 19 2019We consider the problem of the existence of natural improvement dynamics leading to approximate pure Nash equilibria, with a reasonable small approximation, and the problem of bounding the efficiency of such equilibria in the fundamental framework of ... 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
Prophet inequality for bipartite matching: merits of being simple and non adaptiveFeb 17 2019We consider Bayesian online selection problem of a matching in bipartite graphs, i.e., online weighted matching problem with edge arrivals where online algorithm knows distributions of weights, that corresponds to the intersection of two matroids in [Kleinberg ... 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
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete ListsFeb 15 2019In the stable marriage problem (SM), a mechanism that always outputs a stable matching is called a stable mechanism. One of the well-known stable mechanisms is the man-oriented Gale-Shapley algorithm (MGS). MGS has a good property that it is strategy-proof ... 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
Computing the Yolk in Spatial Voting Games without Computing Median LinesFeb 13 2019The yolk is an important concept in spatial voting games as it generalises the equilibrium and provides bounds on the uncovered set. We present near-linear time algorithms for computing the yolk in the spatial voting model in the plane. To the best of ... More
Evaluating Reputation Management Schemes of Internet of Vehicles based on Evolutionary Game TheoryFeb 12 2019Conducting reputation management is very important for Internet of vehicles. However, most of the existing researches evaluate the effectiveness of their schemes with settled attacking behaviors in their simulation which cannot represent the scenarios ... 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
Envy-freeness up to any item with high Nash welfare: The virtue of donating itemsFeb 12 2019Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness. Unfortunately, EFX ... More
Effects of empathy on the evolution of fairness in group-structured populationsFeb 12 2019The ultimatum game has been a prominent paradigm in studying the evolution of fairness. It predicts that responders should accept any nonzero offer and proposers should offer the smallest possible amount according to orthodox game theory. However, the ... 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
The induced metric on the boundary of the convex hull of a quasicircle in hyperbolic and anti de Sitter geometryFeb 11 2019Celebrated work of Alexandrov and Pogorelov determines exactly which metrics on the sphere are induced on the boundary of a compact convex subset of hyperbolic three-space. As a step toward a generalization for unbounded convex subsets, we consider convex ... 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
Election Manipulation on Social Networks with Positive and Negative MessagesFeb 11 2019We study the problem of election control through social influence when the manipulator is allowed to use the locations that she acquired on the network for sending \emph{both} positive and negative messages. We investigate the tie-breaking rules that ... More
Playing Games with Bounded Entropy: Convergence Rate and Approximate EquilibriaFeb 10 2019We consider zero-sum repeated games in which the players are restricted to strategies that require only a limited amount of randomness. Let $v_n$ be the max-min value of the $n$ stage game; previous works have characterized $\lim_{n\rightarrow\infty}v_n$, ... 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
A Game of Drones: Cyber-Physical Security of Time-Critical UAV Applications with Cumulative Prospect Theory Perceptions and ValuationsFeb 09 2019The effective deployment of unmanned aerial vehicle (UAV) systems and services hinges on securing them against cyber-physical attacks that can jeopardize their mission or use them to intrude into secured perimeters. In this paper, a novel mathematical ... 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
Analyzing Location-Based Advertising for Vehicle Service Providers Using Effective ResistancesFeb 06 2019Vehicle service providers can display commercial ads in their vehicles based on passengers' origins and destinations to create a new revenue stream. In this work, we study a vehicle service provider who can generate different ad revenues when displaying ... 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
An Alternating Algorithm for Finding Linear Arrow-Debreu Market EquilibriumFeb 05 2019Motivated by the convergence of mirror-descent algorithms to market equilibria in linear Fisher markets, it is natural to consider designing dynamics (specifically, iterative algorithms) for agents to arrive at linear Arrow-Debreu market equilibria. Jain ... 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
A Framework for Allocating Server Time to Spot and On-demand Services in Cloud ComputingFeb 04 2019Cloud computing delivers value to users by facilitating their access to computing capacity in periods when their need arises. An approach is to provide both on-demand and spot services on shared servers. The former allows users to access servers on demand ... More
On positive scalar curvature cobordisms and the conformal Laplacian on end-periodic manifoldsFeb 01 2019We show that the periodic $\eta$-invariants introduced by Mrowka--Ruberman--Saveliev~\cite{MRS3} provide obstructions to the existence of cobordisms with positive scalar curvature metrics between manifolds of dimensions $4$ and $6$. The proof combines ... More
Coordinating the Crowd: Inducing Desirable Equilibria in Non-Cooperative SystemsJan 30 2019Many real-world systems such as taxi systems, traffic networks and smart grids involve self-interested actors that perform individual tasks in a shared environment. However, in such systems, the self-interested behaviour of agents produces welfare inefficient ... More
Comparing Election Methods Where Each Voter Ranks Only Few CandidatesJan 30 2019Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most to the least ... 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
A higher moment formula for the Siegel--Veech transform over quotients by Hecke triangle groupsJan 29 2019We compute higher moments of the Siegel--Veech transform over quotients of $SL(2,\mathbb{R})$ by the Hecke triangle groups. After fixing a normalization of the Haar measure on $SL(2,\mathbb{R})$ we use geometric results and linear algebra to create explicit ... 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
A Regulation Enforcement Solution for Multi-agent Reinforcement LearningJan 29 2019Human behaviors are regularized by a variety of norms or regulations, either to maintain orders or to enhance social welfare. If artificial intelligent (AI) agents make decisions on behalf of human beings, we would hope they can also follow established ... 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
Game theoretical modelling of network/cyber security [Review paper]Jan 24 2019Game theory is an established branch of mathematics that offers a rich set of mathematical tools for multi-person strategic decision making that can be used to model the interactions of decision makers in security problems who compete for limited and ... 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
Online Learning for Measuring Incentive Compatibility in Ad AuctionsJan 21 2019In this paper we investigate the problem of measuring end-to-end Incentive Compatibility (IC) regret given black-box access to an auction mechanism. Our goal is to 1) compute an estimate for IC regret in an auction, 2) provide a measure of certainty around ... 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
Distributed control and game design: From strategic agents to programmable machinesJan 18 2019Large scale systems are forecasted to greatly impact our future lives thanks to their wide ranging applications including cooperative robotics, mobility on demand, resource allocation, supply chain management. While technological developments have paved ... 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
Solving Simple Stochastic Games with few Random Nodes faster using Bland's RuleJan 16 2019The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected $2^{O(\sqrt{n})}$ time. We first give a simpler iterative variant of this algorithm, using Bland's rule from the simplex algorithm, ... More
How Will the Presence of Autonomous Vehicles Affect the Equilibrium State of Traffic Networks?Jan 16 2019It is known that connected and autonomous vehicles are capable of maintaining shorter headways and distances when they form platoons of vehicles. Thus, such technologies can result in increases in the capacities of traffic networks. Consequently, it is ... 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
An asynchronous, forward-backward, distributed generalized Nash equilibrium seeking algorithmJan 14 2019In this paper, we propose an asynchronous distributed algorithm for the computation of generalized Nash equilibria in noncooperative games, where the players interact via an undirected communication graph. Specifically, we extend the paper "Asynchronous ... 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
A Truthful FPTAS Mechanism for Emergency Demand Response in Colocation Data CentersJan 10 2019Demand response (DR) is not only a crucial solution to the demand side management but also a vital means of electricity market in maintaining power grid reliability, sustainability and stability. DR can enable consumers (e.g. data centers) to reduce their ... 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
Price-Coupling Games and the Generation Expansion Planning ProblemJan 07 2019In this paper, we introduce and study a class of games called price-coupling games that arise in many scenarios, especially in the electricity industry. In a price-coupling game, there is a part of the objective function of a player which has an identical ... More
Intrinsic linking and knotting are arbitrarily complex in directed graphsJan 04 2019Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed, this is the case. ... 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
Formalizing the Boundary Between Strategic and Nonstrategic ReasoningDec 30 2018Research in multiagent systems often does not draw a clear distinction between strategic behavior and other forms of intentional (e.g., boundedly rational) action, which are broadly lumped under the term "nonstrategic". If we are already confident that ... More
New bounds for the simplicial volume of complex hyperbolic surfacesDec 30 2018We give estimates of the Gromov norm of the top dimensional class in $H_c^4(\mathrm{Isom}(\mathbb{H}_{\mathbb{C}}^2);\mathbb{R})$. As a consequence, we obtain an explicit upper bound for the simplicial volume of closed oriented manifolds that are locally ... More
Computing the topology of a planar or space hyperelliptic curveDec 30 2018We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose topology is ... More
Coordinates on the augmented moduli space of convex RP^2 structuresDec 29 2018Let S be an orientable, finite type surface with negative Euler characteristic. The augmented moduli space of convex real projective structures on S was first defined and topologized by the first author. In this article, we give an explicit description ... 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
Evolutionary dynamics in the public goods games with switching between punishment and exclusionDec 25 2018Pro-social punishment and exclusion are common means to elevate the level of cooperation among unrelated individuals. Indeed, it is worth pointing out that the combined use of these two strategies is quite common across human societies. However, it is ... 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
Markov Game Modeling of Moving Target Defense for Strategic Detection of Threats in Cloud NetworksDec 23 2018The processing and storage of critical data in large-scale cloud networks necessitate the need for scalable security solutions. It has been shown that deploying all possible security measures incurs a cost on performance by using up valuable computing ... 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
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information GamesDec 18 2018Online game playing algorithms produce high-quality strategies with a fraction of memory and computation required by their offline alternatives. Continual Resolving (CR) is a recent theoretically sound approach to online game playing that has been used ... More
Semi-Explicit Solutions to some Non-Linear Non-Quadratic Mean-Field-Type Games: A Direct MethodDec 17 2018This article examines the solvability of mean-field-type game problems by means of a direct method. We provide various solvable examples beyond the classical LQ game problems. It includes quadratic-quadratic games, power, logarithmic, sine square, hyperbolic ... 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
Optimal Resource Allocation over Networks via Lottery-Based MechanismsDec 03 2018We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization problem, called ... More