Latest in

total 7527took 0.13s
Hotelling Games with Multiple Line FaultsJul 15 2019The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In this paper, we ... More
Solving Mean-Payoff Games via Quasi DominionsJul 14 2019We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions ... More
The Two-Sided Game of Googol and Sample-Based Prophet InequalitiesJul 13 2019The secretary problem or the game of Googol are classic models for online selection problems that have received significant attention in the last five decades. We consider a variant of the problem and explore its connections to data-driven online selection. ... More
Coloring invariants of knots and links are often intractableJul 13 2019Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting homomorphisms ... More
On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling SystemsJul 12 2019We study cost-sharing games in real-time scheduling systems where the activation cost of the server at any given time is a function of its load. We focus on monomial cost functions and consider both the case when the degree is less than one (inducing ... More
Asynchronous Majority Dynamics in Preferential Attachment TreesJul 12 2019We study information aggregation in networks where agents make binary decisions (labeled incorrect or correct). Agents initially form independent private beliefs about the better decision, which is correct with probability $1/2+\delta$. The dynamics we ... More
Deep Learning-powered Iterative Combinatorial AuctionsJul 12 2019In this paper, we study the design of deep learning-powered iterative combinatorial auctions (ICAs). We build on the work by Brero et al. (2018), who have successfully integrated support vector regression (SVR) into the preference elicitation algorithm ... More
Mobility restores the mechanism which supports cooperation in the voluntary prisoner's dilemma gameJul 11 2019It is generally believed that in a situation where individual and collective interests are in conflict, the availability of optional participation is a key mechanism to maintain cooperation. Surprisingly, this effect is sensitive to the use of microscopic ... More
On Relevant Equilibria in Reachability GamesJul 11 2019We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always exists a Nash equilibrium (NE) and a subgame perfect equilibrium (SPE). ... More
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVCJul 11 2019Motivated by applications in the security of cyber-physical systems, we pose the finite blocklength communication problem in the presence of a jammer as a zero-sum game between the encoder-decoder team and the jammer, by allowing the communicating team ... More
Time-aware uniformization of winning strategiesJul 11 2019Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may help with actual ... More
Cake Cutting on Graphs: A Discrete and Bounded Proportional ProtocolJul 11 2019The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well ... More
How should we score athletes and candidates: geometric scoring rulesJul 11 2019Individual rankings are often aggregated using scoring rules: each position in each ranking brings a certain score; the total sum of scores determines the aggregate ranking. We study whether scoring rules can be robust to adding or deleting particular ... More
Proportional Dynamics in Exchange EconomiesJul 11 2019We study the Proportional Response dynamic in exchange economies, where each player starts with some amount of money and a good. Every day, the players bring one unit of their good and submit bids on goods they like, each good gets allocated in proportion ... More
Optimal mechanisms with budget for user generated contentsJul 10 2019In this paper, we design gross product maximization mechanisms which incentivize users to upload high-quality contents on user-generated-content (UGC) websites. We show that, the proportional division mechanism, which is widely used in practice, can perform ... More
A Little Charity Guarantees Almost Envy-FreenessJul 10 2019Jul 12 2019Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute $m$ goods to $n$ agents in a "fair" manner, where every agent has a valuation for each subset of goods. We assume general valuations. Envy-freeness ... More
A Little Charity Guarantees Almost Envy-FreenessJul 10 2019Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute $m$ goods to $n$ agents in a "fair" manner, where every agent has a valuation for each subset of goods. We assume general valuations. Envy-freeness ... More
An algorithmic framework for approximating maximin share allocation of choresJul 10 2019In this paper, we consider the problem of how to fairly dividing $m$ indivisible chores among $n$ agents. The fairness measure we considered here is the maximin share. The previous best known result is that there always exists a $\frac{4}{3}$ approximation ... More
Assortment planning for two-sided sequential matching marketsJul 10 2019Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension between recommending ... More
The Ad Types ProblemJul 09 2019The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are $k$ types of nodes on one side (the ads), and an ordered set of nodes on the other side (the slots). The edge weight of an ad $i$ of type $\theta$ ... More
Selling Information Through ConsultingJul 09 2019We consider a monopoly information holder selling information to a budget-constrained decision maker, who may benefit from the seller's information. The decision maker has a utility function that depends on his action and an uncertain state of the world. ... More
Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-AscentJul 09 2019Gradient descent is arguably one of the most popular online optimization methods with a wide array of applications. However, the standard implementation where agents simultaneously update their strategies yields several undesirable properties; strategies ... More
The Secretary Recommendation ProblemJul 09 2019In this paper we revisit the basic variant of the classical secretary problem. We propose a new approach, in which we separate between an agent that evaluates the secretary performance and one that has to make the hiring decision. The evaluating agent ... More
Robust Revenue Maximization Under Minimal Statistical InformationJul 09 2019We study the problem of multi-dimensional revenue maximization when selling $m$ items to a buyer that has additive valuations for them, drawn from a (possibly correlated) prior distribution. Unlike traditional Bayesian auction design, we assume that the ... More
Approximately Stable Matchings with General ConstraintsJul 09 2019This paper focuses on two-sided matching where one side (a hospital or firm) is matched to the other side (a doctor or worker) so as to maximize a cardinal objective under general feasibility constraints. In a standard model, even though multiple doctors ... More
A Mathematical Analysis of an Election System Proposed by Gottlob FregeJul 08 2019We provide a mathematical analysis of an election system proposed by the eminent logician Gottlob Frege (1848--1925). His proposal was written presumably in 1918, was (re)discovered around the turn of the millennium, and published for the first time in ... More
Symmetries of Spatial Graphs in Homology SpheresJul 06 2019This paper explores the relationship between symmetries of spatial graphs in $S^3$ and symmetries of spatial graphs in homology $3$-spheres and other $3$-manifolds. We prove that for any $3$-connected graph $G$, an automorphism $\sigma$ is induced by ... More
Adversarial Fault Tolerant Training for Deep Neural NetworksJul 06 2019Jul 09 2019Deep Learning Accelerators are prone to faults which manifest in the form of errors in Neural Networks. Fault Tolerance in Neural Networks is crucial in real-time safety critical applications requiring computation for long durations. Neural Networks with ... More
Genetic Network Architecture SearchJul 05 2019We propose a method for learning the neural network architecture that based on Genetic Algorithm (GA). Our approach uses a genetic algorithm integrated with standard Stochastic Gradient Descent(SGD) which allows the sharing of weights across all architecture ... More
Fair Division through Information WithholdingJul 04 2019Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods that addresses pairwise envy by the removal of at most one good. In the worst case, each pair of agents might require the (hypothetical) removal of a different ... More
Borel invariant for Zimmer cocycles of 3-manifold groupsJul 04 2019Let $\Gamma$ be a non-uniform lattice of $\text{PSL}(2,\mathbb{C})$. Given any representation $\rho:\Gamma \rightarrow \text{PSL}(n,\mathbb{C})$ we can define a numerical invariant $\beta_n(\rho)$, called Borel invariant, which remains constant along ... More
Technical report for "Virtual Energy Storage Sharing and Capacity Allocation"Jul 03 2019Energy storage can play an important role in energy management of end users. To promote an efficient utilization of energy storage, we develop a novel business model to enable virtual storage sharing among a group of users. Specifically, a storage aggregator ... More
Technical report for "Virtual Energy Storage Sharing and Capacity Allocation"Jul 03 2019Jul 07 2019Energy storage can play an important role in energy management of end users. To promote an efficient utilization of energy storage, we develop a novel business model to enable virtual storage sharing among a group of users. Specifically, a storage aggregator ... More
Pricing in Resource Allocation Games Based on Duality GapsJul 03 2019We consider a basic resource allocation game, where the players' strategy spaces are subsets of $\mathbb{R}^m$ and cost/utility functions are parameterized by some common vector $u$ and, otherwise, only depend on the own strategy choice. A strategy of ... More
Algorithms for Competitive Division of ChoresJul 03 2019We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities, when money transfers are not allowed. The competitive rule is known to be the best mechanism for goods with additive utilities and was recently extended ... More
Simplicial complexity of surface groups and systolic areaJul 02 2019The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of the systolic ... More
Adapting Stable Matchings to Evolving PreferencesJul 02 2019Adaptivity to changing environments and constraints is key to success in modern society. We address this view by proposing "incrementalized versions" of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for both problems, ... More
Energy mean-payoff gamesJul 02 2019In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first player (the protagonist) ... More
An Axiomatization of the Shapley-Shubik Index for Interval DecisionsJul 02 2019The Shapley-Shubik index was designed to evaluate the power distribution in committee systems drawing binary decisions and is one of the most established power indices. It was generalized to decisions with more than two levels of approval in the input ... More
Incomplete Preferences in Single-Peaked ElectoratesJul 01 2019Incomplete preferences are likely to arise in real-world preference aggregation scenarios. This paper deals with determining whether an incomplete preference profile is single-peaked. This is valuable information since many intractable voting problems ... More
Bayesian Generalized Network DesignJun 30 2019We study network coordination problems, as captured by the setting of generalized network design (Emek et al., STOC 2018), in the face of uncertainty resulting from partial information that the network users hold regarding the actions of their peers. ... More
N-Person Discrete-Time Dynamic Games of Asymmetric InformationJun 30 2019This paper considers a class of N-person discrete-time dynamic games with an asymmetric information structure. Each player has private information revealed only to himself, which is modeled as a random variable called the type. Each player aims to find ... More
Strategic Learning Approach for Deploying UAV-provided Wireless ServicesJun 30 2019Unmanned Aerial Vehicle (UAV) have emerged as a promising technique to rapidly provide wireless services to a group of mobile users simultaneously. The paper aims to address a challenging issue that each user is selfish and may misreport his location ... More
Multistability and regime shifts in microbial communities explained by competition for essential nutrientsJun 29 2019Microbial communities routinely have several possible species compositions or community states observed for the same environmental parameters. Changes in these parameters can trigger abrupt and persistent transitions (regime shifts) between such community ... More
Stable Matchings in Divorce GraphsJun 28 2019In this paper, we study the Reaching Stable Marriage via Divorce Operations problem, which given a Stable Marriage instance and an initial matching, asks whether a stable matching for the instance is reachable by a sequence of divorce operations as introduced ... More
Stable Matchings in Divorce GraphsJun 28 2019Jul 02 2019In this paper, we study the Reaching Stable Marriage via Divorce Operations problem, which given a Stable Marriage instance and an initial matching, asks whether a stable matching for the instance is reachable by a sequence of divorce operations as introduced ... More
How to Evaluate Trading Strategies: Single Agent Market Replay or Multiple Agent Interactive Simulation?Jun 28 2019We show how a multi-agent simulator can support two important but distinct methods for assessing a trading strategy: Market Replay and Interactive Agent-Based Simulation (IABS). Our solution is important because each method offers strengths and weaknesses ... More
Playing Adaptively Against Stealthy Opponents: A Reinforcement Learning Strategy for the FlipIt Security GameJun 27 2019A rise in Advanced Persistant Threats (APTs) has introduced a need for robustness against long-running, stealthy attacks which circumvent existing cryptographic security guarantees. FlipIt is a security game that models the attacker-defender interactions ... More
Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal AuctionJun 27 2019What fraction of the single item $n$ buyers setting's expected optimal revenue MyeRev can the second price auction with reserves achieve? In the special case where the buyers' valuation distributions are all drawn i.i.d. and the distributions satisfy ... More
Further Results on Stability-Preserving Mechanisms for School ChoiceJun 27 2019We build on the stability-preserving school choice model introduced and studied recently in [MV18]. We settle several of their open problems and we define and solve a couple of new ones.
Further Results on Stability-Preserving Mechanisms for School ChoiceJun 27 2019Jun 29 2019We build on the stability-preserving school choice model introduced and studied recently in [MV18]. We settle several of their open problems and we define and solve a couple of new ones.
Truly Concurrent Bisimilarities are Game EquivalentJun 27 2019We design games for truly concurrent bisimilarities, including strongly truly concurrent bisimilarities and branching truly concurrent bisimilarities, such as pomset bisimilarities, step bisimilarities, history-preserving bisimilarities and hereditary ... More
Adaptive Honeypot Engagement through Reinforcement Learning of Semi-Markov Decision ProcessesJun 27 2019The honeynet is a promising active cyber defense mechanism. It reveals the fundamental Indicators of Compromise (IoC) by luring attackers to conduct adversarial behaviors in a controlled and monitored environment. The active interaction at the honeynet ... More
Incentive Mechanisms to Prevent Efficiency Loss of Non-Profit UtilitiesJun 26 2019The modernization of the power system introduces technologies that may improve the system's efficiency by enhancing the capabilities of users. Despite their potential benefits, such technologies can have a negative impact. This subject has widely analyzed, ... More
Rethinking Formal Models of Partially Observable Multiagent Decision MakingJun 26 2019Multiagent decision-making problems in partially observable environments are usually modeled as either extensive-form games (EFGs) within the game theory community or partially observable stochastic games (POSGs) within the reinforcement learning community. ... More
The Complexity of Black-Box Mechanism Design with PriorsJun 26 2019We study black-box reductions from mechanism design to algorithm design for welfare maximization in settings of incomplete information. Given oracle access to an algorithm for an underlying optimization problem, the goal is to simulate an incentive compatible ... More
Asymptotically Moebius maps and rigidity for the hyperbolic planeJun 25 2019Let $S$ be a rank-one symmetric space of non-compact type and let $X$ be a $\text{CAT}(-1)$ space. A well-known result by Bourdon states that if a topological embedding $\varphi: \partial_\infty S \rightarrow \partial_\infty X$ respects cross ratios, ... More
A Compact, Logical Approach to Large-Market AnalysisJun 25 2019In game theory, we often use infinite models to represent "limit" settings, such as markets with a large number of agents or games with a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that, while introduced for simplicity, ... More
The dual-process approach to human sociality: A reviewJun 24 2019Which social decisions are intuitive? Which are deliberative? The dual-process approach to human sociality has emerged in the last decades as a vibrant and exciting area of research. Here, I review the existing literature on the cognitive basis of cooperation, ... More
Online Revenue Maximization for Server PricingJun 24 2019Efficient and truthful mechanisms to price resources on remote servers/machines has been the subject of much work in recent years due to the importance of the cloud market. This paper considers revenue maximization in the online stochastic setting with ... More
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable FlowsJun 24 2019This work analyzes the minimum tollbooth problem in atomic network congestion games with unsplittable flows. The goal is to place tolls on edges, such that there exists a pure Nash equilibrium in the tolled game that is a social optimum in the untolled ... More
Foolproof Cooperative LearningJun 24 2019This paper extends the notion of equilibrium in game theory to learning algorithms in repeated stochastic games. We define a learning equilibrium as an algorithm used by a population of players, such that no player can individually use an alternative ... More
Penalty Bidding Mechanisms for Allocating Resources and Overcoming Present BiasJun 24 2019From skipped exercise classes to last-minute cancellation of dentist appointments, underutilization of reserved resources abounds, arising from uncertainty about the future and further exacerbated by present bias -- the constant struggle between our current ... More
A Dynamic Games Approach to Proactive Defense Strategies against Advanced Persistent Threats in Cyber-Physical SystemsJun 24 2019Advanced Persistent Threats (APTs) have recently emerged as a significant security challenge for Cyber-Physical Systems (CPSs) due to APTs' stealthy, dynamic and adaptive nature. The proactive dynamic defense provides a strategic and holistic security ... More
Single-crossing ImplementationJun 23 2019An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive properties: e.g., ... More
Protecting shared information in networks: a network security game with strategic attacksJun 22 2019A digital security breach, by which confidential information is leaked, does not only affect the agent whose system is infiltrated, but is also detrimental to other agents socially connected to the infiltrated system. Although it has been argued that ... More
Bayesian Nash Equilibrium in First-Price Auction with Discrete Value DistributionsJun 22 2019Jul 09 2019First price auctions are widely used in government contracts and industrial auctions. In this paper, we consider the Bayesian Nash Equilibrium (BNE) in first price auctions with discrete value distributions. We study the characterization of the BNE in ... More
Reserve Pricing in Repeated Second-Price Auctions with Strategic BiddersJun 21 2019We study revenue optimization learning algorithms for repeated second-price auctions with reserve where a seller interacts with multiple strategic bidders each of which holds a fixed private valuation for a good and seeks to maximize his expected future ... More
Reinforcement Learning with Convex ConstraintsJun 21 2019In standard reinforcement learning (RL), a learning agent seeks to optimize the overall reward. However, many key aspects of a desired behavior are more naturally expressed as constraints. For instance, the designer may want to limit the use of unsafe ... More
Simple Mechanisms for Profit Maximization in Multi-item AuctionsJun 21 2019We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller. How can the ... More
Fairness and Utilization in Allocating Resources with Uncertain DemandJun 21 2019Resource allocation problems are a fundamental domain in which to evaluate the fairness properties of algorithms, and the trade-offs between fairness and utilization have a long history in this domain. A recent line of work has considered fairness questions ... More
Finding Needles in a Moving Haystack: Prioritizing Alerts with Adversarial Reinforcement LearningJun 20 2019Detection of malicious behavior is a fundamental problem in security. One of the major challenges in using detection systems in practice is in dealing with an overwhelming number of alerts that are triggered by normal behavior (the so-called false positives), ... More
Individual Fairness in Sponsored Search AuctionsJun 20 2019Fairness in advertising is a topic of particular interest in both the computer science and economics literatures, supported by theoretical and empirical observations. We initiate the study of tradeoffs between individual fairness and performance in online ... More
Privacy, altruism, and experience: Estimating the perceived value of Internet data for medical usesJun 20 2019People increasingly turn to the Internet when they have a medical condition. The data they create during this process is a valuable source for medical research and for future health services. However, utilizing these data could come at a cost to user ... More
Near-optimal Reinforcement Learning using Bayesian QuantilesJun 20 2019We study model-based reinforcement learning in finite communicating Markov Decision Process. Algorithms in this settings have been developed in two different ways: the first view, which typically provides frequentist performance guarantees, uses optimism ... More
Near-optimal Bayesian Solution For Unknown Discrete Markov Decision ProcessJun 20 2019Jul 09 2019We tackle the problem of acting in an unknown finite and discrete Markov Decision Process (MDP) for which the expected shortest path from any state to any other state is bounded by a finite number $D$. An MDP consists of $S$ states and $A$ possible actions ... More
The Complexity of Online Bribery in Sequential ElectionsJun 19 2019Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in sequentially, ... More
Who is in Your Top Three? Optimizing Learning in Elections with Many CandidatesJun 19 2019Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter provides their ... More
Nash equilibria in games over graphs equipped with a communication mechanismJun 18 2019We study pure Nash equilibria in infinite-duration games on graphs, with partial visibility of actions but communication (based on a graph) among the players. We show that a simple communication mechanism consisting in reporting the deviator when seeing ... More
Aggregate Play and Welfare in Strategic Interactions on NetworksJun 18 2019In recent work by Bramoull\'{e} and Kranton, a model for the provision of public goods on a network was presented and relations between equilibria of such a game and properties of the network were established. This model was further extended to include ... More
Weighted Maxmin Fair Share Allocation of Indivisible ChoresJun 18 2019We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly ... More
On the Tractability of Public Persuasion with No ExternalitiesJun 18 2019Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large body of algorithmic ... More
On the Existence of Pareto Efficient and Envy Free AllocationsJun 17 2019Envy-freeness and Pareto Efficiency are two major goals in welfare economics. The existence of an allocation that satisfies both conditions has been studied for a long time. Whether items are indivisible or divisible, it is impossible to achieve envy-freeness ... More
A Dynamic Game Approach to Strategic Design of Secure and Resilient Infrastructure NetworkJun 17 2019Infrastructure networks are vulnerable to both cyber and physical attacks. Building a secure and resilient networked system is essential for providing reliable and dependable services. To this end, we establish a two-player three-stage game framework ... More
Protecting Elections by Recounting BallotsJun 17 2019Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in favor of a ... More
Solution of Two-Player Zero-Sum Game by Successive RelaxationJun 16 2019We consider the problem of two-player zero-sum game. In this setting, there are two agents working against each other. Both the agents observe the same state and the objective of the agents is to compute a strategy profile that maximizes their rewards. ... More
Social Cost Guarantees in Smart Route GuidanceJun 15 2019We model and study the problem of assigning traffic in an urban road network infrastructure. In our model, each driver submits their intended destination and is assigned a route to follow that minimizes the social cost (i.e., travel distance of all the ... More
Learning in Cournot Games with Limited Information FeedbackJun 15 2019In this work, we study the interaction of strategic players in continuous action Cournot games with limited information feedback. Cournot game is the essential market model for many socio-economic systems where players learn and compete without the full ... More
PREStO: A Systematic Framework for Blockchain Consensus ProtocolsJun 15 2019The rapid evolution of the blockchain community has brought together stakeholders from fundamentally different backgrounds: cryptographers, protocol designers, software developers, startup entrepreneurs, corporate executives and investors, academics of ... More
Problems with the EFG formalism: a solution attempt using observationsJun 14 2019We argue that the extensive-form game (EFG) model isn't powerful enough to express all important aspects of imperfect information games, such as those related to decomposition and online game solving. We present a principled attempt to fix the formalism ... More
Non-zero-sum Stackelberg Budget Allocation Game for Computational AdvertisingJun 14 2019Jun 17 2019Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a market leader (a leader) requires the acquisition of new customers as well ... More
Non-zero-sum Stackelberg Budget Allocation Game for Computational AdvertisingJun 14 2019Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a market leader (a leader) requires the acquisition of new customers as well ... More
Report-Sensitive Spot-Checking in Peer-Grading SystemsJun 13 2019Peer grading systems make large courses more scalable, provide students with faster and more detailed feedback, and help students to learn by thinking critically about the work of others. A key obstacle to the broader adoption of peer grading is motivating ... More
Competing Bandits in Matching MarketsJun 12 2019Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive online markets powered by data-driven matching platforms, it has become necessary ... More
Estimation of the Shapley value by ergodic samplingJun 12 2019The idea of approximating the Shapley value of an n-person game by random sampling was introduced by Castro et al. (2009) and further improved by Maleki et al. (2013) and Castro et al. (2017) using stratification. In contrast to their independent sampling ... More
Prophet Inequalities on the Intersection of a Matroid and a GraphJun 12 2019We consider prophet inequalities in a setting where agents correspond to both elements in a matroid and vertices in a graph. A set of agents is feasible if they form both an independent set in the matroid and an independent set in the graph. Our main ... More
Competing (Semi)-Selfish Miners in BitcoinJun 11 2019The Bitcoin protocol prescribes certain behavior by the miners who are responsible for maintaining and extending the underlying blockchain; in particular, miners who successfully solve a puzzle, and hence can extend the chain by a block, are supposed ... More
The Demand Query Model for Bipartite MatchingJun 10 2019We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching seem to be ... More
FaRM: Fair Reward Mechanism for Information Aggregation in Spontaneous Localized Settings (Extended Version)Jun 10 2019Although peer prediction markets are widely used in crowdsourcing to aggregate information from agents, they often fail to reward the participating agents equitably. Honest agents can be wrongly penalized if randomly paired with dishonest ones. In this ... More
Analysis of a Poisson-picking symmetric winners-take-all game with randomized payoffsJun 09 2019Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter choice that is ... More