Related papers: Cops or robbers - a bistable society

We study the problem of computing an $\epsilon$-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model---modeling the players…

In this paper we address the cooperation problem in structured populations by considering the prisoner's dilemma game as metaphor of the social interactions between individuals with imitation capacity. We present a new strategy update rule…

We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…

Indirect reciprocity explains the evolution of cooperation by considering how our cooperative behavior toward someone is reciprocated by someone else who has observed us. A cohesive society has a shared norm that prescribes how to assess…

There is increasing regulatory interest in whether machine learning algorithms deployed in consequential domains (e.g. in criminal justice) treat different demographic groups "fairly." However, there are several proposed notions of…

The game of Cops and Robber is traditionally played on a finite graph. The purpose of this note is to introduce and analyze the game that is played on an arbitrary geodesic space. The game is defined in such a way that it preserves the…

The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the…

A generalized version of the Maximum Work Theorem is valid when the system is initially not at thermal equilibrium. In this work, we initially study the fraction of trajectories that violate this generalized theorem for a two simple…

We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performance guarantees with…

Evolutionary game theory has impacted many fields of research by providing a mathematical framework for studying the evolution and maintenance of social and moral behaviors. This success is owed in large part to the demonstration that the…

We address the task of identifying anomalous observations by analyzing digits under the lens of Benford's law. Motivated by the crucial objective of providing reliable statistical analysis of customs declarations, we answer one major and…

We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…

We investigate a cops and robber game on directed graphs, where the robber moves along the arcs of the graph, while the cops can select any position at each time step. Our main focus is on the cop number: the minimum number of cops required…

This paper studies semiparametric contextual bandits, a generalization of the linear stochastic bandit problem where the reward for an action is modeled as a linear function of known action features confounded by an non-linear…

Much of modern society is founded on orchestrating institutions that produce social goods by fostering motivated teams, pitting them against each other, and distributing the fruits of the arms races that ensue. However, even when the…

The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…

Social hierarchy is important that can not be ignored in human socioeconomic activities and in the animal world. Here we incorporate this factor into the evolutionary game to see what impact it could have on the cooperation outcome. The…

We introduce a novel multi-armed bandit framework, where each arm is associated with a fixed unknown credal set over the space of outcomes (which can be richer than just the reward). The arm-to-credal-set correspondence comes from a known…

Traditional coding theory guarantees valid decoding only if a minority of symbols are adversarially manipulated. In contrast, the game of coding framework ensures reliable decoding, even in the presence of an adversarial majority. This…

In this paper, we consider a general observation model for restless multi-armed bandit problems. The operation of the player is based on the past observation history that is limited (partial) and error-prone due to resource constraints or…