Latest in cs.gt
total 5128took 0.21s
Algorithmic Bidding for Virtual Trading in Electricity MarketsFeb 08 2018We consider the problem of optimal bidding for virtual trading in two-settlement electricity markets. A virtual trader aims to arbitrage on the differences between day-ahead and real-time market prices; both prices, however, are random and unknown to ... More Detection Games Under Fully Active AdversariesFeb 08 2018We study a binary hypothesis testing problem in which a defender must decide whether or not a test sequence has been drawn from a given memoryless source $P_0$ whereas, an attacker strives to impede the correct detection. With respect to previous works, ... More Monopoly pricing with buyer searchFeb 08 2018In many shopping scenarios, e.g., in online shopping, customers have a large menu of options to choose from. However, most of the buyers do not browse all the options and make decision after considering only a small part of the menu. To study such buyer's ... More The dynamic framework of decision-makingFeb 07 2018This work explores dynamics existing in interactions between players. The dynamic system of games is a new attitude to modeling in which an event is modeled using several games. The model allows us to analyze the interplay capabilities and the feasibility ... More Truthful mechanisms for ownership transfer with expert adviceFeb 05 2018When a company undergoes a merger or transfer of its ownership, the existing governing body has an opinion on which buyer should take over as the new owner. Similar situations occur while assigning the host of big sports tournaments, e.g., the World Cup ... More On a Generic Security Game ModelJan 18 2018To protect the systems exposed to the Internet against attacks, a security system with the capability to engage with the attacker is needed. There have been attempts to model the engagement/interactions between users, both benign and malicious, and network ... More Fair mixing: the case of dichotomous preferencesDec 07 2017Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and guarantees to any group ... More Evolutionary dynamics of cooperation in neutral populationsDec 06 2017Cooperation is a difficult proposition in the face of Darwinian selection. Those that defect have an evolutionary advantage over cooperators who should therefore die out. However, spatial structure enables cooperators to survive through the formation ... More Symbolic vs. Bounded Synthesis for Petri GamesNov 29 2017Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to ... More Flows on the PSL(V)-Hitchin componentSep 11 2017Sep 30 2017In this article we define new flows on the Hitchin components for PSL(n,R). Special examples of these flows are associated to simple closed curves on the surface and give generalized twist flows. Other examples, so called eruption flows, are associated ... More The Asymmetric Colonel Blotto GameAug 26 2017This paper explores the Nash equilibria of a variant of the Colonel Blotto game, which we call the Asymmetric Colonel Blotto game. In the Colonel Blotto game, two players simultaneously distribute forces across $n$ battlefields. Within each battlefield, ... More Selfish Network Creation with Non-Uniform Edge CostJun 30 2017Network creation games investigate complex networks from a game-theoretic point of view. Based on the original model by Fabrikant et al. [PODC'03] many variants have been introduced. However, almost all versions have the drawback that edges are treated ... More Centers of disks in Riemannian manifoldsJun 25 2017We prove the existence of a center, or continuous selection of a point, in the relative interior of $C^1$ embedded $k$-disks in Riemannian $n$-manifolds. If $k\le 3$ the center can be made equivariant with respect to the isometries of the manifold, and ... More Fractional Hedonic GamesMay 29 2017The work we present in this paper initiated the formal study of fractional hedonic games, coalition formation games in which the utility of a player is the average value he ascribes to the members of his coalition. Among other settings, this covers situations ... More Differential algebra of cubic planar graphsMay 02 2017May 03 2017In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In addition, ... More Stability of Service under Time-of-Use PricingApr 07 2017We consider "time-of-use" pricing as a technique for matching supply and demand of temporal resources with the goal of maximizing social welfare. Relevant examples include energy, computing resources on a cloud computing platform, and charging stations ... More Parity Games, Imperfect Information and Structural ComplexityMar 02 2017We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with perfect information can be solved in PTIME. Restricting the structural complexity ... More Competitive division of a mixed mannaFeb 02 2017A mixed manna contains goods (that everyone likes), bads (that everyone dislikes), as well as items that are goods to some agents, but bads or satiated to others. If all items are goods and utility functions are homothetic, concave (and monotone), the ... More Deforming convex real projective structuresFeb 02 2017Let S be a closed, connected, orientable surface of genus at least 2, and let C(S) denote the deformation space of convex real projective structures S. In this article, we introduce two new flows on C(S), which we call the internal bulging flow and the ... More A Bayesian Game without epsilon equilibriaJan 27 2017We present a three player Bayesian game for which there is no epsilon equilibria in Borel measurable strategies for small enough epsilon, however there are non-measurable equilibria. Competitive Caching of Contents in 5G Edge Cloud NetworksDec 05 2016The surge of mobile data traffic forces network operators to cope with capacity shortage. The deployment of small cells in 5G networks is meant to reduce latency, backhaul traffic and increase radio access capacity. In this context, mobile edge computing ... More Proportional RankingsDec 05 2016In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that cohesive groups of ... More On the existence of weak subgame perfect equilibriaDec 05 2016We study multi-player turn-based games played on a directed graph, where the number of players and vertices can be infinite. An outcome is assigned to every play of the game. Each player has a preference relation on the set of outcomes which allows him ... More Peer Prediction with Heterogeneous TasksDec 03 2016Peer prediction is a method to promote contributions of information by users in settings in which there is no way to verify the quality of responses. In multi-task peer prediction, the reports from users across multiple tasks are used to score contributions. ... More An impossibility theorem for paired comparisonsDec 01 2016In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. An axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and multiple comparisons is presented. ... More Cognitive hierarchy theory and two-person gamesNov 30 2016The outcome of many social and economic interactions, such as stock-market transactions, is strongly determined by the predictions that agents make about the behavior of other individuals. Cognitive Hierarchy Theory provides a framework to model the consequences ... More A Majoritarian Representative Voting SystemNov 30 2016We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each ballot to a single ... More Proportional Justified RepresentationNov 29 2016The goal of multi-winner elections is to choose a fixed-size committee based on voters' preferences. An important concern in this setting is representation: large groups of voters with cohesive preferences should be adequately represented by the election ... More Constrained Pure Nash Equilibria in Polymatrix GamesNov 29 2016We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on incoming edges ... More Maximum a posteriori learning in demand competition gamesNov 28 2016We consider an inventory competition game between two firms. The question we address is this: If players do not know the opponent's action and opponent's utility function can they learn to play the Nash policy in a repeated game by observing their own ... More Generalizing the Kelly strategyNov 28 2016Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous ... More Generalizing the Kelly strategyNov 28 2016Nov 29 2016Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous ... More Generalizing the Kelly strategyNov 28 2016Dec 06 2016Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous ... More The Complexity of Succinct ElectionsNov 27 2016The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the list succinctly, as the distinct votes of the electorate and ... More Teams in Online Scheduling Polls: Game-Theoretic AspectsNov 27 2016Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken during the meeting, ... More Phragmén's and Thiele's election methodsNov 27 2016The election methods introduced in 1894--1895 by Phragm\'en and Thiele, and their somewhat later versions for ordered (ranked) ballots, are discussed in detail. The paper includes definitions and examples and discussion of whether the methods satisfy ... More Multiwinner Approval Rules as Apportionment MethodsNov 26 2016We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that they induce apportionment ... More Admissibility in Quantitative Graph GamesNov 26 2016Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case and cooperative ... More Homological dimension and dimensional full-valuednessNov 25 2016There are different definitions of homological dimension of metric compacta involving either \v{C}ech homology or exact (Steenrod) homology. In this paper we investigate the relation between these homological dimensions with respect to different groups. ... More Proxy Voting for Better OutcomesNov 24 2016We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer their voting ... More Mechanism Design for Multi-Type Housing MarketsNov 23 2016We study multi-type housing markets, where there are $p\ge 2$ types of items, each agent is initially endowed one item of each type, and the goal is to design mechanisms without monetary transfer to (re)allocate items to the agents based on their preferences ... More Symbolic BDD and ADD Algorithms for Energy GamesNov 23 2016Energy games, which model quantitative consumption of a limited resource, e.g., time or energy, play a central role in quantitative models for reactive systems. Reactive synthesis constructs a controller which satisfies a given specification, if one exists. ... More What You Really Need To Know About Your NeighborNov 23 2016A fundamental question in system design is to decide how much of the design of one component must be known in order to successfully design another component of the system. We study this question in the setting of reactive synthesis, where one constructs ... More Randomized Mechanisms for Selling Reserved Instances in CloudNov 22 2016Selling reserved instances (or virtual machines) is a basic service in cloud computing. In this paper, we consider a more flexible pricing model for instance reservation, in which a customer can propose the time length and number of resources of her request, ... More Quasi-regular sequences and optimal schedules for security gamesNov 22 2016Nov 29 2016In security games, a defender commits to a mixed strategy for protecting a set of $n$ targets of values $\alpha_i$; an attacker, knowing the defender's strategy, chooses which target to attack and for how long. We study a natural version in which the ... More Two statements of the Duggan-Schwartz theoremNov 21 2016The Duggan-Schwartz theorem (Duggan and Schwartz, 1992) is a famous result concerning strategy-proof social choice correspondences, often stated as "A social choice correspondence that can be manipulated by neither an optimist nor a pessimist has a weak ... More Manipulability of consular election rulesNov 21 2016The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz theorem proves ... More Simple Mechanisms for Subadditive Buyers via DualityNov 21 2016We provide simple and approximately revenue-optimal mechanisms in the multi-item multi-bidder settings. We unify and improve all previous results, as well as generalize the results to broader cases. In particular, we prove that the better of the following ... More Fair Division via Social ComparisonNov 20 2016In the classical cake cutting problem, a resource must be divided among agents with different utilities so that each agent believes they have received a fair share of the resource relative to the other agents. We introduce a variant of the problem in ... More Manifolds with conullity at most two as graph manifoldsNov 20 2016We find necessary and sufficient conditions for a complete Riemannian manifold $M^n$ of finite volume, whose curvature tensor has nullity at least $n-2$, to be a geometric graph manifold and classify the ones with nonnegative scalar curvature. In the ... More Team-maxmin equilibrium: efficiency bounds and algorithmsNov 18 2016The Team-maxmin equilibrium prescribes the optimal strategies for a team of rational players sharing the same goal and without the capability of correlating their strategies in strategic games against an adversary. This solution concept can capture situations ... More Dependent Types for Extensive GamesNov 18 2016Extensive games are tools largely used in economics to describe decision processes of a community of agents. In this paper we propose a formal presentation based on the proof assistant Coq which focuses mostly on infinite extensive games and their characteristics. ... More Hotelling-Downs Model with Limited AttractionNov 18 2016In this paper we study variations of the standard Hotelling-Downs model of spatial competition, where each agent attracts the clients in a restricted neighborhood, each client randomly picks one attractive agent for service. Two utility functions for ... More Swap Equilibria under Link and Vertex DestructionNov 17 2016We initiate the study of the \emph{destruction model} (\aka \emph{adversary model}) introduced by Kliemann (2010), using the stability concept of \emph{swap equilibrium} introduced by Alon et. al (2010). The destruction model is a network formation game ... More Market Segmentation for Privacy Differentiated "Free" ServicesNov 16 2016Nov 18 2016The emerging marketplace for online free services in which service providers earn revenue from using consumer data in direct and indirect ways has lead to significant privacy concerns. This leads to the following question: can the online marketplace sustain ... More Market Segmentation for Privacy Differentiated "Free" ServicesNov 16 2016The emerging marketplace for online free services in which service providers earn revenue from using consumer data in direct and indirect ways has lead to significant privacy concerns. This begs understanding of the following question: can the marketplace ... More Approximately Efficient Two-Sided Combinatorial AuctionsNov 16 2016Mechanism design for one-sided markets has been investigated for several decades in economics and in computer science. More recently, there has been an increased attention on mechanisms for two-sided markets, in which buyers and sellers act strategically. ... More Search-and-Rescue RendezvousNov 16 2016We consider a new type of asymmetric rendezvous search problem in which Agent II needs to give Agent I a `gift' which can be in the form of information or material. The gift can either be transfered upon meeting, as in traditional rendezvous, or it can ... More Group Activity Selection on Social NetworksNov 14 2016We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups. We show that if multiple groups can simultaneously engage in the same ... More Sequential Solutions in Machine Scheduling GamesNov 13 2016We consider the classical machine scheduling, where n jobs need to be scheduled on m machines, with the goal of minimizing the makespan, i.e., the maximum load of any machine in the schedule. We study inefficiency of schedules that are obtained when jobs ... More