total 7112took 0.14s

Economic Viability of Data Trading with RolloverMay 16 2019Mobile Network Operators (MNOs) are providing more flexible wireless data services to attract subscribers and increase revenues. For example, the data trading market enables user-flexibility by allowing users to sell leftover data to or buy extra data ... More

On planar Cayley graphs and Kleinian groupsMay 16 2019Let $G$ be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface $X \subseteq \mathbb{S}^2$. We prove that $G$ admits such an action that is in addition co-compact, provided we can replace $X$ ... More

Multi-Cap Optimization for Wireless Data Plans with Time FlexibilityMay 15 2019An effective way for a Mobile network operator (MNO) to improve its revenue is price discrimination, i.e., providing different combinations of data caps and subscription fees. Rollover data plan (allowing the unused data in the current month to be used ... More

Dashboard Mechanisms for Online MarketplacesMay 14 2019This paper gives a theoretical model for design and analysis of mechanisms for online marketplaces where a bidding dashboard enables the bid-optimization of long-lived agents. We assume that a good allocation algorithm exists when given the true values ... More

Capacity and Price Competition in Markets with Congestion EffectsMay 14 2019We study oligopolistic competition in service markets where firms offer a service to customers. The service quality of a firm (from a customer's perspective) depends on the level of congestion and the charged price. A firm can set a price for the service ... More

Crowdsourcing Data Acquisition via Social NetworksMay 14 2019We consider a requester who acquires a set of data (e.g. images) that is not owned by one party. In order to collect all the data, crowdsourcing mechanisms have been widely used to seek help from the crowd. However, existing mechanisms rely on third-party ... More

Fixed-price Diffusion Mechanism DesignMay 14 2019We consider a fixed-price mechanism design setting where a seller sells one item via a social network, but the seller can only directly communicate with her neighbours initially. Each other node in the network is a potential buyer with a valuation derived ... More

Desingularizing positive scalar curvature 4-manifoldsMay 13 2019We show that the bordism group of closed 3-manifolds with positive scalar curvature (psc) metrics is trivial by explicit methods. Our constructions are derived from scalar-flat K{\"a}hler ALE surfaces discovered by Lock-Viaclovsky. Next, we study psc ... More

Approximation Schemes for a Buyer with Independent Items via SymmetriesMay 13 2019We consider a revenue-maximizing seller with $n$ items facing a single buyer. We introduce the notion of $symmetric~menu~complexity$ of a mechanism, which counts the number of distinct options the buyer may purchase, up to permutations of the items. Our ... More

Diversity and Exploration in Social LearningMay 13 2019In consumer search, there is a set of items. An agent has a prior over her value for each item and can pay a cost to learn the instantiation of her value. After exploring a subset of items, the agent chooses one and obtains a payoff equal to its value ... More

The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large EconomiesMay 13 2019We revisit the connection between bargaining and equilibrium in exchange economies, and study its algorithmic implications. We consider bargaining outcomes to be allocations that cannot be blocked (i.e., profitably re-traded) by coalitions of small size ... More

Impossibility of Full Decentralization in Permissionless BlockchainsMay 13 2019Bitcoin uses blockchain technology and proof-of-work (PoW) mechanism where nodes spend computing resources and earn rewards in return for spending these resources. This incentive system has caused power to be significantly biased towards a few nodes, ... More

Exogenous Rewards for Promoting Cooperation in Scale-Free NetworksMay 13 2019The design of mechanisms that encourage pro-social behaviours in populations of self-regarding agents is recognised as a major theoretical challenge within several areas of social, life and engineering sciences. When interference from external parties ... More

Differentiable Game MechanicsMay 13 2019Deep learning is built on the foundational guarantee that gradient descent on an objective function converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, that exhibit multiple interacting losses. ... More

Learning and Planning in Feature Deception GamesMay 13 2019Today's high-stakes adversarial interactions feature attackers who constantly breach the ever-improving security measures. Deception mitigates the defender's loss by misleading the attacker to make suboptimal decisions. In order to formally reason about ... More

CoLight: Learning Network-level Cooperation for Traffic Signal ControlMay 11 2019Cooperation is critical in multi-agent reinforcement learning (MARL). In the context of traffic signal control, good cooperation among the traffic signal agents enables the vehicles to move through intersections more smoothly. Conventional transportation ... More

Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step SizesMay 11 2019We show for the first time, to our knowledge, that it is possible to reconcile in online learning in zero-sum games two seemingly contradictory objectives: vanishing time-average regret and non-vanishing step sizes. This phenomenon, that we coin ``fast ... More

Limited Resource Optimal Distribution Algorithm Based on Game Iteration MethodMay 11 2019The article provides a solution algorithm for the linear programming problem (LPP) with the latter being presented as an antagonistic matrix game so the game's further solution is based on the iterative method. The algorithm is presented as a computer ... More

Group Fairness in Committee SelectionMay 11 2019In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviate and choose a committee of proportional size, so that all these voters ... More

Learning an Unknown Network State in Routing GamesMay 11 2019We study learning dynamics induced by myopic travelers who repeatedly play a routing game on a transportation network with an unknown state. The state impacts cost functions of one or more edges of the network. In each stage, travelers choose their routes ... More

Average Weights and Power in Weighted Voting GamesMay 10 2019We investigate a class of weighted voting games for which weights are randomly distributed over the unit simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th largest player under the uniform ... More

Optimal Auctions vs. Anonymous Pricing: Beyond Linear UtilityMay 10 2019The revenue optimal mechanism for selling a single item to agents with independent but non-identically distributed values is complex for agents with linear utility (Myerson,1981) and has no closed-form characterization for agents with non-linear utility ... More

Perfect Prediction in Minkowski Spacetime: Perfectly Transparent Equilibrium for Dynamic Games with Imperfect InformationMay 10 2019The assumptions of necessary rationality and necessary knowledge of strategies, also known as perfect prediction, lead to at most one surviving outcome, immune to the knowledge that the players have of them. Solutions concepts implementing this approach ... More

Asymptotics of multivariate sequences in the presence of a lacunaMay 10 2019We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions $d \geq 4$. This result depends on computations in the homology of the algebraic variety where ... More

Signaling equilibria in mean-field gamesMay 10 2019In this paper, we consider both finite and infinite horizon discounted dynamic mean-field games where there is a large population of homogeneous players sequentially making strategic decisions and each player is affected by other players through an aggregate ... More

Bidding Mechanisms in Graph GamesMay 09 2019In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. We study {\em bidding games} in which the players bid for the right to move the token. Several bidding ... More

The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal RevenueMay 09 2019Bulow and Klemperer's well-known result states that, in a single-item auction where the $n$ bidders' values are independently and identically drawn from a regular distribution, the Vickrey auction with one additional bidder (a duplicate) extracts at least ... More

On Geodesic Triangles in Hyperbolic PlaneMay 09 2019Let M be an orientable hyperbolic surface without boundary and let $\gamma$ be a closed geodesic in M. We prove that any side of any triangle formed by distinct lifts of $\gamma$ in H2 is shorter than $\gamma$.

Proportionally Fair ClusteringMay 09 2019We extend the fair machine learning literature by considering the problem of proportional centroid clustering in a metric context. For clustering $n$ points with $k$ centers, we define fairness as proportionality to mean that any $n/k$ points are entitled ... More

Determinacy in Discrete-Bidding Infinite-Duration GamesMay 09 2019In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and ... More

The Implications of Pricing on Social LearningMay 09 2019We study the implications of endogenous pricing for learning and welfare in the classic herding model . When prices are determined exogenously, it is known that learning occurs if and only if signals are unbounded. By contrast, we show that learning can ... More

On the Existence of Three-Dimensional Stable Matchings with Cyclic PreferencesMay 07 2019We study the three-dimensional stable matching problem with cyclic preferences. This model involves three types of agents, with an equal number of agents of each type. The types form a cyclic order such that each agent has a complete preference list over ... More

Deep Landscape Forecasting for Real-time Bidding AdvertisingMay 07 2019May 12 2019The emergence of real-time auction in online advertising has drawn huge attention of modeling the market competition, i.e., bid landscape forecasting. The problem is formulated as to forecast the probability distribution of market price for each ad auction. ... More

Deep Landscape Forecasting for Real-time Bidding AdvertisingMay 07 2019The emergence of real-time auction in online advertising has drawn huge attention of modeling the market competition, i.e., bid landscape forecasting. The problem is formulated as to forecast the probability distribution of market price for each ad auction. ... More

Non-clairvoyant Precedence Constrained SchedulingMay 06 2019We consider the online problem of scheduling jobs on identical machines, where jobs have precedence constraints. We are interested in the demanding setting where the jobs sizes are not known up-front, but are revealed only upon completion (the non-clairvoyant ... More

Unsupervised Domain Adaptation using Graph Transduction GamesMay 06 2019Unsupervised domain adaptation (UDA) amounts to assigning class labels to the unlabeled instances of a dataset from a target domain, using labeled instances of a dataset from a related source domain. In this paper, we propose to cast this problem in a ... More

The distortion of distributed votingMay 06 2019Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the voting process on ... More

Well-quasi-order of plane minors and an application to link diagramsMay 06 2019A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if the plane minor ... More

Computing a Data DividendMay 06 2019Quality data is a fundamental contributor to success in statistics and machine learning. If a statistical assessment or machine learning leads to decisions that create value, data contributors may want a share of that value. This paper presents methods ... More

Connected sums of almost complex manifolds, products of rational homology spheres, and the twisted spin^c Dirac operatorMay 05 2019We record an answer to the question "In which dimensions is the connected sum of two closed almost complex manifolds necessarily an almost complex manifold?". In the process of doing so, we are naturally led to ask "For which values of l is the connected ... More

A Polynomial Time Algorithm for Fair Resource Allocation in Resource ExchangeMay 05 2019The rapid growth of wireless and mobile Internet has led to wide applications of exchanging resources over network, in which how to fairly allocate resources has become a critical challenge. To motivate sharing, a BD Mechanism is proposed for resource ... More

LP-based Approximation for Personalized Reserve PricesMay 04 2019We study the problem of computing \comment{revenue-optimal} personalize \comment{(non-anonymous)} reserve prices in eager second price auction \comment{in a single-item environment} without having any assumption on valuation distributions. Here, the input ... More

LP-based Approximation for Personalized Reserve PricesMay 04 2019May 10 2019We study the problem of computing personalized reserve prices in eager second price auctions without having any assumption on valuation distributions. Here, the input is a dataset that contains the submitted bids of $n$ buyers in a set of auctions and ... More

Regression EquilibriumMay 04 2019Prediction is a well-studied machine learning task, and prediction algorithms are core ingredients in online products and services. Despite their centrality in the competition between online companies who offer prediction-based products, the \textit{strategic} ... More

Job Edge-Fog Interconnection Network Creation Game in Internet of ThingsMay 04 2019This is the first paper to address the topology structure of Job Edge-Fog interconnection network in the perspective of network creation game. A two level network creation game model is given, in which the first level is similar to the traditional network ... More

Pandora's Problem with Nonobligatory InspectionMay 04 2019Martin Weitzman's "Pandora's problem" furnishes the mathematical basis for optimal search theory in economics. Nearly 40 years later, Laura Doval introduced a version of the problem in which the searcher is not obligated to pay the cost of inspecting ... More

Improved Metric Distortion for Deterministic Social Choice RulesMay 04 2019In this paper, we study the metric distortion of deterministic social choice rules that choose a winning candidate from a set of candidates based on voter preferences. Voters and candidates are located in an underlying metric space. A voter has cost equal ... More

The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is)May 02 2019The declining price anomaly states that the price weakly decreases when multiple copies of an item are sold sequentially over time. The anomaly has been observed in a plethora of practical applications. On the theoretical side, Gale and Stegeman proved ... More

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and OnlineMay 02 2019The framework of budget-feasible mechanism design studies procurement auctions where the auctioneer (buyer) aims to maximize his valuation function subject to a hard budget constraint. We study the problem of designing truthful mechanisms that have good ... More

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and OnlineMay 02 2019May 06 2019The framework of budget-feasible mechanism design studies procurement auctions where the auctioneer (buyer) aims to maximize his valuation function subject to a hard budget constraint. We study the problem of designing truthful mechanisms that have good ... More

Price of Privacy in the Keynesian Beauty ContestMay 02 2019The Keynesian Beauty Contest is a classical game in which strategic agents seek to both accurately guess the true state of the world as well as the average action of all agents. We study an augmentation of this game where agents are concerned about revealing ... More

Instantons, Bar-Natan homology, and some concordance invariants of knotsMay 02 2019May 05 2019A spectral sequence is established, from Bar-Natan's variant of Khovanov homology to a deformation of instanton homology for knots and links. This spectral sequence arises as a specialization of a spectral sequence from a characteristic-2 version of $F_5$ ... More

Instantons, Bar-Natan homology, and some concordance invariants of knotsMay 02 2019A spectral sequence is established, from Bar-Natan's variant of Khovanov homology to a deformation of instanton homology for knots and links. This spectral sequence arises as a specialization of a spectral sequence from a characteristic-2 version of $F_5$ ... More

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)May 02 2019May 03 2019We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we focus ... More

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)May 02 2019We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we focus ... More

Static Pricing: Universal Guarantees for Reusable ResourcesMay 02 2019We consider a fundamental pricing model in which a fixed number of units of a reusable resource are used to serve customers. Customers arrive to the system according to a stochastic process and upon arrival decide to purchase or not the service depending ... More

Static Pricing: Universal Guarantees for Reusable ResourcesMay 02 2019May 13 2019We consider a fundamental pricing model in which a fixed number of units of a reusable resource are used to serve customers. Customers arrive to the system according to a stochastic process and upon arrival decide whether or not to purchase the service, ... More

Some Structure Properties of Finite Normal-Form GamesMay 02 2019Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic structure of ... More

Reputation-Based Information Design for Inducing Prosocial BehaviorMay 02 2019We study the idea of information design for inducing prosocial behavior in the context of electricity consumption. We consider a continuum of agents. Each agent has a different intrinsic motivation to reduce her power consumption. Each agent models the ... More

Envy-Freeness in House Allocation ProblemsMay 01 2019We consider the house allocation problem, where $m$ houses are to be assigned to $n$ agents so that each agent gets exactly one house. We present a polynomial-time algorithm that determines whether an envy-free assignment exists, and if so, computes one ... More

Truthful Aggregation of Budget ProposalsMay 01 2019We consider a participatory budgeting problem in which each voter submits a proposal for how to divide a single divisible resource (such as money or time) among several possible alternatives (such as public projects or activities) and these proposals ... More

Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity RequirementsMay 01 2019We describe our experience with designing and running a matching market for the Israeli "Mechinot" gap-year programs. The main conceptual challenge in the design of this market was the rich set of diversity considerations, which necessitated the development ... More

The Complexity of POMDPs with Long-run Average ObjectivesApr 30 2019We study the problem of approximation of optimal values in partially-observable Markov decision processes (POMDPs) with long-run average objectives. POMDPs are a standard model for dynamic systems with probabilistic and nondeterministic behavior in uncertain ... More

Analyzing Defense Strategies Against Mobile Information Leakages: A Game-Theoretic ApproachApr 30 2019Abuse of zero-permission sensors on-board mobile and wearable devices to infer users' personal context and information is a well-known privacy threat that has received significant attention. Efforts towards protection mechanisms that prevent or limit ... More

Matrix Group Integrals, Surfaces, and Mapping Class Groups II: $\mathrm{O}\left(n\right)$ and $\mathrm{Sp}\left(n\right)$Apr 30 2019Let $w$ be a word in the free group on $r$ generators. The expected value of the trace of the word in $r$ independent Haar elements of $\mathrm{O}(n)$ gives a function ${\cal T}r_{w}^{\mathrm{O}}(n)$ of $n$. We show that ${\cal T}r_{w}^{\mathrm{O}}(n)$ ... More

The positive scalar curvature cobordism categoryApr 29 2019We prove that many spaces of positive scalar curvature metrics have the homotopy type of infinite loop spaces. Our result in particular applies to the path component of the round metric inside $\mathcal{R}^+ (S^d)$ if $d \geq 6$. To achieve that goal, ... More

When Sally Found Harry: A Stochastic Search GameApr 29 2019Harry hides on an edge of a graph and does not move from there. Sally, starting from a known origin, tries to find him as soon as she can. Harry's goal is to be found as late as possible. At any given time, each edge of the graph is either active or inactive, ... More

Competitive Statistical Estimation with Strategic Data SourcesApr 29 2019In recent years, data has played an increasingly important role in the economy as a good in its own right. In many settings, data aggregators cannot directly verify the quality of the data they purchase, nor the effort exerted by data sources when creating ... More

On proper branched coverings and a question of VuorinenApr 29 2019We study global injectivity of proper branched coverings defined on the Euclidean $n$-ball in the case when the branch set is compact. In particular we show that such mappings are homeomorphisms when $n=3$ or when the branch set is empty. This proves ... More

Efficiency in Truthful Auctions via a Social NetworkApr 29 2019In this paper, we study efficiency in truthful auctions via a social network, where a seller can only spread the information of an auction to the buyers through the buyers' network. In single-item auctions, we show that no mechanism is strategy-proof, ... More

A process algebraic form to represent extensive gamesApr 27 2019In this paper, we introduce an agent-based representation of games, in order to propose a compact representation for multi-party games in game theory. Our method is inspired by concepts in process theory and process algebra. In addition, we introduce ... More

Improving the complexity of Parys' recursive algorithmApr 26 2019May 09 2019Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art complexity of broadly ... More

Improving the complexity of Parys' recursive algorithmApr 26 2019Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art complexity of broadly ... More

Quantized VCG Mechanisms for Polymatroid EnvironmentsApr 26 2019Many network resource allocation problems can be viewed as allocating a divisible resource, where the allocations are constrained to lie in a polymatroid. We consider market-based mechanisms for such problems. Though the Vickrey-Clarke-Groves (VCG) mechanism ... More

Prediction with Expert Advice: a PDE PerspectiveApr 25 2019This work addresses a classic problem of online prediction with expert advice. We assume an adversarial opponent, and we consider both the finite-horizon and random-stopping versions of this zero-sum, two-person game. Focusing on an appropriate continuum ... More

The game semantics of game theoryApr 25 2019We use a reformulation of compositional game theory to reunite game theory with game semantics, by viewing an open game as the System and its choice of contexts as the Environment. Specifically, the system is jointly controlled by $n \geq 0$ noncooperative ... More

Smart Jammer and LTE Network Strategies in An Infinite-Horizon Zero-Sum Repeated Game with Asymmetric and Incomplete InformationApr 25 2019LTE/LTE-Advanced networks are known to be vulnerable to denial-of-service and loss-of-service attacks from smart jammers. In this article, the interaction between a smart jammer and LTE network is modeled as an infinite-horizon, zero-sum, asymmetric repeated ... More

Enhanced IoV Security Network by using Blockchain Governance GameApr 24 2019This paper deals with the design of the secure network of the Enhanced Internet of Vehicles by using the Blockchain Governance Game. The BGG is the system model of the stochastic game to find best strategies towards preparation for preventing a network ... More

When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price-of-AnarchyApr 24 2019Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game theory has emerged as a valuable tool to complement more traditional techniques. ... More

On-Demand Density-Aware UAV Base Station 3D Placement for Arbitrarily Distributed Users with Guaranteed Data RatesApr 24 2019In this letter, we study the on-demand UAV-BS placement problem for arbitrarily distributed users. This UAV-BS placement problem is modeled as a knapsack-like problem, which is NP-complete. We propose a density-aware placement algorithm to maximize the ... More

On Optimal Battery Sizing for Households Participating in Demand-Side Management SchemesApr 24 2019The smart grid with its two-way communication and bi-directional power layers is a cornerstone in the combat against global warming. It allows for the large scale adoption of distributed (individually-owned) renewable energy resources such as solar photovoltaic ... More

Solving zero-sum extensive-form games with arbitrary payoff uncertainty modelsApr 24 2019Modeling strategic conflict from a game theoretical perspective involves dealing with epistemic uncertainty. Payoff uncertainty models are typically restricted to simple probability models due to computational restrictions. Recent breakthroughs Artificial ... More

Deep Q-Learning for Nash Equilibria: Nash-DQNApr 23 2019Model-free learning for multi-agent stochastic games is an active area of research. Existing reinforcement learning algorithms, however, are often restricted to zero-sum games, and are applicable only in small state-action spaces or other simplified settings. ... More

Matrix-Valued Mean-Field-Type Games: Risk-Sensitive, Adversarial, and Risk-Neutral Linear-Quadratic CaseApr 23 2019In this paper we study a class of matrix-valued linear-quadratic mean-field-type games for both the risk-neutral, risk-sensitive and robust cases. Non-cooperation, full cooperation and adversarial between teams are treated. We provide a semi-explicit ... More

Network Investment Game with Wardrop FollowersApr 23 2019We study a two-sided network investment game consisting of two sets of players, called providers and users. The game is set in two stages. In the first stage, providers aim to maximize their profit by investing in bandwidth of cloud computing services. ... More

Investment in EV charging spots for parkingApr 22 2019As demand for electric vehicles (EVs) is expanding, meeting the need for charging infrastructure, especially in urban areas, has become a critical issue. One method of adding charging stations is to install them at parking spots. This increases the value ... More

Multimedia Crowdsourcing with Bounded Rationality: A Cognitive Hierarchy ProspectiveApr 22 2019In multimedia crowdsourcing, the requester's quality requirements and reward decisions will affect the workers' task selection strategies and the quality of their multimedia contributions. In this paper, we present a first study on how the workers' bounded ... More

Multimedia Crowdsourcing with Bounded Rationality: A Cognitive Hierarchy PerspectiveApr 22 2019Apr 25 2019In multimedia crowdsourcing, the requester's quality requirements and reward decisions will affect the workers' task selection strategies and the quality of their multimedia contributions. In this paper, we present a first study on how the workers' bounded ... More

Deformation and quasiregular extension of cubical Alexander mapsApr 19 2019In this article we prove that, for an oriented PL $n$-manifold $M$ with $m$ boundary components and $d_0\in \mathbb N$, there exist mutually disjoint closed Euclidean balls and a $\mathsf K$-quasiregular mapping $M \to \mathbb S^n \setminus \mathrm{int}(B_1\cup ... More

Negative Prices in Network Pricing GamesApr 18 2019In a Stackelberg network pricing game, a leader sets prices for a given subset of edges so as to maximize profit, after which one or multiple followers choose a shortest path from their source to sink. We study the counter-intuitive phenomenon that the ... More

An Extended Game-Theoretic Model for Aggregate Lane Choice Behavior of Vehicles at Traffic Diverges with a Bifurcating LaneApr 17 2019Road network junctions, such as merges and diverges, often act as bottlenecks that initiate and exacerbate congestion. More complex junction configurations lead to more complex driver behaviors, resulting in aggregate congestion patterns that are more ... More

Berge equilibria in n-person 2-strategy gamesApr 17 2019An algorithm for finding all Berge equilibria in the sense of Zhukovskii in n-person 2-strategy games in pure and mixed strategies is given.

Computational Complexity of Stable Marriage and Stable Roommates and Their VariantsApr 17 2019This paper gives an overview on and summarizes existing complexity and algorithmic results of some variants of the Stable Marriage and the Stable Roommates problems. The last section defines a list of stable matching problems mentioned in the paper. If ... More

Analysing Neural Network Topologies: a Game Theoretic ApproachApr 17 2019Artificial Neural Networks have shown impressive success in very different application cases. Choosing a proper network architecture is a critical decision for a network's success, usually done in a manual manner. As a straightforward strategy, large, ... More

Drones in Distress: A Game-Theoretic Countermeasure for Protecting UAVs Against GPS SpoofingApr 16 2019One prominent security threat that targets unmanned aerial vehicles (UAVs) is the capture via GPS spoofing in which an attacker manipulates a UAV's global positioning system (GPS) signals in order to capture it. Given the anticipated widespread deployment ... More

Semi-equivelar maps of Euler characteristics -2 with few verticesApr 16 2019We enumerate and classify all the semi equivelar maps on the surface of $ \chi=-2 $ with up to 12 vertices. We also determine which of these are vertex-transitive and which are not.

Geometric Network Creation GamesApr 15 2019Network Creation Games are a well-known approach for explaining and analyzing the structure, quality and dynamics of real-world networks like the Internet and other infrastructure networks which evolved via the interaction of selfish agents without a ... More

Cooperation on the monte carlo rule Prison's dilemma game on the gridApr 15 2019In this paper, we investigate the prison's dilemma game with monte carlo rule in the view of the idea of the classic Monte Carlo method on the grid. Monte carlo rule is an organic combination of the current dynamic rules of individual policy adjustment, ... More

When Tesla Meets Nash: Wireless Power Provision as a Public GoodApr 15 2019The wireless power transfer (WPT) technology enables a cost-effective and sustainable energy supply in wireless networks. However, the broadcast nature of wireless signals makes them non-excludable public goods, which leads to potential free-riders among ... More

Predicting human decisions with behavioral theories and machine learningApr 15 2019Behavioral decision theories aim to explain human behavior. Can they help predict it? An open tournament for prediction of human choices in fundamental economic decision tasks is presented. The results suggest that integration of certain behavioral theories ... More