The CyberCIEGE project seeks to create an alternative to traditional Information Assurance (IA) training and education approaches by developing an interactive, entertaining commercial-grade PC-based computer game/virtual laboratory. CyberCIEGE will provide a robust, flexible and extensible gaming environment where each instance of the game is based on a fully customizable scenario. These scenarios are written in the CyberCIEGE Scenario Definition Language. Unfortunately, the trade-off for...

Topics: Computer networks, Security measures, Study and teaching, Game theory, Grammar, Comparative and...

5
5.0

texts

######
eye 5

######
favorite 0

######
comment 0

c1980

Topics: . 169-174, hematics, -- Mathematics, -- Mathematic, Game theory

6
6.0

Jun 25, 2019
06/19

by
Préteceille, Edmond

texts

######
eye 6

######
favorite 0

######
comment 0

208 p. : 23 cm. --

Topics: City planning -- Simulation methods, Game theory

12
12

Jun 27, 2018
06/18

by
Yukun Cheng; Sanming Zhou

texts

######
eye 12

######
favorite 0

######
comment 0

In a facility game one or more facilities are placed in a metric space to serve a set of selfish agents whose addresses are their private information. In a classical facility game, each agent wants to be as close to a facility as possible, and the cost of an agent can be defined as the distance between her location and the closest facility. In an obnoxious facility game, each agent wants to be far away from all facilities, and her utility is the distance from her location to the facility set....

Topics: Computer Science and Game Theory, Combinatorics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1503.07426

8
8.0

Jun 28, 2018
06/18

by
Marcello Mamino

texts

######
eye 8

######
favorite 0

######
comment 0

We prove that to find optimal positional strategies for stochastic mean payoff games when the value of every state of the game is known, in general, is as hard as solving such games tout court. This answers a question posed by Daniel Andersson and Peter Bro Miltersen.

Topics: Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1506.04641

3
3.0

Jun 28, 2018
06/18

by
Gabriele Farina; Nicola Gatti

texts

######
eye 3

######
favorite 0

######
comment 0

The design of the best economic mechanism for Sponsored Search Auctions (SSAs) is a central task in computational mechanism design/game theory. Two open questions concern the adoption of user models more accurate than that one currently used and the choice between Generalized Second Price auction (GSP) and Vickrey-Clark-Groves mechanism (VCG). In this paper, we provide some contributions to answer these questions. We study Price of Anarchy (PoA) and Price of Stability (PoS) over social welfare...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1511.07397

4
4.0

Jun 29, 2018
06/18

by
Jon Kleinberg; Sigal Oren; Manish Raghavan

texts

######
eye 4

######
favorite 0

######
comment 0

Present bias, the tendency to weigh costs and benefits incurred in the present too heavily, is one of the most widespread human behavioral biases. It has also been the subject of extensive study in the behavioral economics literature. While the simplest models assume that the agents are naive, reasoning about the future without taking their bias into account, there is considerable evidence that people often behave in ways that are sophisticated with respect to present bias, making plans based...

Topics: Physics and Society, Physics, Computer Science and Game Theory, Multiagent Systems, Computing...

Source: http://arxiv.org/abs/1603.08177

23
23

Jun 28, 2018
06/18

by
Karl-Dieter Crisman; Michael E. Orrison

texts

######
eye 23

######
favorite 0

######
comment 0

This paper is a survey of some of the ways in which the representation theory of the symmetric group has been used in voting theory and game theory. In particular, we use permutation representations that arise from the action of the symmetric group on tabloids to describe, for example, a surprising relationship between the Borda count and Kemeny rule in voting. We also explain a powerful representation-theoretic approach to working with linear symmetric solution concepts in cooperative game...

Topics: Computing Research Repository, Mathematics, Representation Theory, Computer Science and Game Theory

Source: http://arxiv.org/abs/1508.05891

15
15

Jun 28, 2018
06/18

by
Haris Aziz

texts

######
eye 15

######
favorite 0

######
comment 0

The housing market setting constitutes a fundamental model of exchange economies of goods. In most of the work concerning housing markets, it is assumed that agents own and are allocated discrete houses. The drawback of this assumption is that it does not cater for randomized assignments or allocation of time-shares. Recently, house allocation with fractional endowment of houses was considered by Athanassoglou and Sethuraman (2011) who posed the open problem of generalizing Gale's Top Trading...

Topics: Computing Research Repository, Data Structures and Algorithms, Computer Science and Game Theory

Source: http://arxiv.org/abs/1509.03915

5
5.0

Feb 1, 2021
02/21

by
Maynard Smith, John, 1920-2004

texts

######
eye 5

######
favorite 1

######
comment 0

vi, 264 pages

Topics: Evolution (Biology), Sex (Biology), Game theory, Biological Evolution, Sex, Game Theory,...

55
55

Apr 23, 2009
04/09

by
Goffman, Erving

texts

######
eye 55

######
favorite 1

######
comment 0

Includes bibliographical references

Topics: Social interaction, Expression, Game theory

18
18

Oct 18, 2020
10/20

by
Comic Drake

movies

######
eye 18

######
favorite 0

######
comment 0

The surviving episodes of a deleted series posted to the Game Theorists channel by a creator named Comic Drake. (Taken from Wayback Machine entries)

Topics: game theory, smash history, comic, drake, matpat, video, videos, deleted, lost, missing, the game...

48
48

Sep 21, 2019
09/19

by
The Game Theorists

movies

######
eye 48

######
favorite 0

######
comment 0

Unlisted Culture Shock video by the Game Theorists

Topics: gaijan goomba, culture shock, villager jew, game theory

Journal of Research of the National Bureau of Standards

Topics: aggregation, equilibrium, game theory, mathematical economics, noncooperative games, total orders.

University of Illinois Urbana-Champaign

190
190

Apr 5, 2011
04/11

by
Postlewaite, A; Schmeidler, David, 1939- joint author; University of Illinois at Urbana-Champaign. College of Commerce and Business Administration

texts

######
eye 190

######
favorite 0

######
comment 0

Title page includes summary of paper

Topics: Equilibrium (Economics), Game theory, Social choice

9
9.0

Jun 29, 2020
06/20

by
Mingshu Cong

texts

######
eye 9

######
favorite 0

######
comment 0

We set up a supply-side game-theoretic model for cooperative production of virtual products. In our model, a group of producers collaboratively produce a virtual product by contributing costly input resources to a production coalition. Producers are capacitated, i.e., they cannot contribute more resources than their capacity limits. Our model is an abstraction of emerging internet-based business models such as federated learning and crowd computing. To maintain an efficient and stable...

Topics: Computational Game Theory, Federated Learning, Cooperative Game

Passenger rail systems continue to be a prime target for terrorists. Since 1995, there have been hundreds of attacks targeting assets worldwide that have resulted in almost 1,000 deaths and more than 1,500 injuries. As evidenced by the March 2016 attack in Brussels, Belgium, the openness and accessibility of passenger rail facilities are attractive to adversaries. This thesis reviews the current approach to risk assessment used by system operators to counter threats and proposes a new model to...

Topics: passenger rail security, decision making, risk assessment, rail systems, metro, mass transit,...

4
4.0

Jun 30, 2018
06/18

by
Krishnendu Chatterjee; Rasmus Ibsen-Jensen

texts

######
eye 4

######
favorite 0

######
comment 0

We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1404.5734

3
3.0

Jun 30, 2018
06/18

by
Arnob Ghosh; Saswati Sarkar

texts

######
eye 3

######
favorite 0

######
comment 0

We investigate a spectrum oligopoly market where each primary seeks to sell secondary access to its channel at multiple locations. Transmission qualities of a channel evolve randomly. Each primary needs to select a price and a set of non-interfering locations (which is an independent set in the conflict graph of the region) at which to offer its channel without knowing the transmission qualities of the channels of its competitors. We formulate the above problem as a non-cooperative game. We...

Topics: Computer Science and Game Theory, Networking and Internet Architecture, Computing Research...

Source: http://arxiv.org/abs/1404.6766

5
5.0

Jun 29, 2018
06/18

by
John J. Nay; Yevgeniy Vorobeychik

texts

######
eye 5

######
favorite 0

######
comment 0

The Prisoner's Dilemma has been a subject of extensive research due to its importance in understanding the ever-present tension between individual self-interest and social benefit. A strictly dominant strategy in a Prisoner's Dilemma (defection), when played by both players, is mutually harmful. Repetition of the Prisoner's Dilemma can give rise to cooperation as an equilibrium, but defection is as well, and this ambiguity is difficult to resolve. The numerous behavioral experiments...

Topics: Economics, Quantitative Finance, Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1601.07792

3
3.0

Jun 30, 2018
06/18

by
Yunpeng Wang; Walid Saad; Narayan B. Mandayam; H. Vincent Poor

texts

######
eye 3

######
favorite 0

######
comment 0

In this paper, the interactions and energy exchange decisions of a number of geographically distributed storage units are studied under decision-making involving end-users. In particular, a noncooperative game is formulated between customer-owned storage units where each storage unit's owner can decide on whether to charge or discharge energy with a given probability so as to maximize a utility that reflects the tradeoff between the monetary transactions from charging/discharging and the...

Topics: Computer Science and Game Theory, Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1403.1248

2
2.0

Jun 30, 2018
06/18

by
Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu

texts

######
eye 2

######
favorite 0

######
comment 0

We consider players that have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $\theta^*$, consists of a set of distributions, from one of which $\theta_i^*$ has been drawn. We prove a ``robustness'' theorem for Knightian players in single-parameter domains: every mechanism that is weakly dominant-strategy truthful for classical players continues to be well-behaved for Knightian players...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1403.6411

2
2.0

Jun 30, 2018
06/18

by
Simon DeDeo

texts

######
eye 2

######
favorite 0

######
comment 0

Group-level cognitive states are widely observed in human social systems, but their discussion is often ruled out a priori in quantitative approaches. In this paper, we show how reference to the irreducible mental states and psychological dynamics of a group is necessary to make sense of large scale social phenomena. We introduce the problem of mental boundaries by reference to a classic problem in the evolution of cooperation. We then provide an explicit quantitative example drawn from ongoing...

Topics: Physics, Quantitative Biology, Neurons and Cognition, Computer Science and Game Theory, Physics and...

Source: http://arxiv.org/abs/1407.2210

2
2.0

Jun 30, 2018
06/18

by
Amir Ban; Nati Linial

texts

######
eye 2

######
favorite 0

######
comment 0

Market share and quality, or customer satisfaction, go together. Yet inferring one from the other appears difficult. Indeed, such an inference would need detailed information about customer behavior, and might be clouded by modes of behavior such as herding (following popularity) or elitism, where customers avoid popular products. We investigate a fixed-price model where customers are informed about their history with products and about market share data. We find that it is in fact correct to...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1407.3641

3
3.0

Jun 30, 2018
06/18

by
Mehrdad Khaledi; Mojgan Khaledi; Hamidreza Rabiee

texts

######
eye 3

######
favorite 0

######
comment 0

Selfish behaviors are common in self-organized Mobile Ad hoc Networks (MANETs) where nodes belong to different authorities. Since cooperation of nodes is essential for routing protocols, various methods have been proposed to stimulate cooperation among selfish nodes. In order to provide sufficient incentives, most of these methods pay nodes a premium over their actual costs of participation. However, they lead to considerably large overpayments. Moreover, existing methods ignore mobility of...

Topics: Computer Science and Game Theory, Networking and Internet Architecture, Computing Research...

Source: http://arxiv.org/abs/1407.7464

2
2.0

Jun 30, 2018
06/18

by
Haris Aziz

texts

######
eye 2

######
favorite 0

######
comment 0

We consider the multi-unit random assignment problem in which agents express preferences over objects and objects are allocated to agents randomly based on the preferences. The most well-established preference relation to compare random allocations of objects is stochastic dominance (SD) which also leads to corresponding notions of envy-freeness, efficiency, and weak strategyproofness. We show that there exists no rule that is anonymous, neutral, efficient and weak strategyproof. For...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1401.7700

2
2.0

Jun 30, 2018
06/18

by
David Auger; Pierre COUCHENEY; Yann Strozecki

texts

######
eye 2

######
favorite 0

######
comment 0

The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in $NP \cap coNP$ which are not known to be in $P$. However, there are some cases where these games can be easily solved, as for instance when the underlying graph is acyclic. In this work, we try to extend this tractability to several classes of games that can be thought as "almost" acyclic. We give some fixed-parameter...

Topics: Computer Science and Game Theory, Computational Complexity, Computing Research Repository, Data...

Source: http://arxiv.org/abs/1402.0471

2
2.0

Jun 30, 2018
06/18

by
Zengfeng Zhang; Lingyang Song; Zhu Han; Walid Saad

texts

######
eye 2

######
favorite 0

######
comment 0

In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with...

Topics: Computer Science and Game Theory, Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1402.2479

2
2.0

Jun 30, 2018
06/18

by
Piotr Skowron; Krzysztof Rzadca; Anwitaman Datta

texts

######
eye 2

######
favorite 0

######
comment 0

To successfully complete a complex project, be it a construction of an airport or of a backbone IT system, agents (companies or individuals) must form a team having required competences and resources. A team can be formed either by the project issuer based on individual agents' offers (centralized formation); or by the agents themselves (decentralized formation) bidding for a project as a consortium---in that case many feasible teams compete for the contract. We investigate rational strategies...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1402.2970

2
2.0

Jun 30, 2018
06/18

by
Ioannis Caragiannis; Angelo Fanelli; Nick Gravin

texts

######
eye 2

######
favorite 0

######
comment 0

We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation games. Our results improve previous ones by Bhalgat et al.~(EC 10) in terms of the obtained approximation guarantee. More importantly, our algorithm identifies a polynomially-long sequence of improvement moves from any initial state to an approximate equilibrium in these games. The existence of such short sequences is...

Topics: Computer Science and Game Theory, Computational Complexity, Computing Research Repository

Source: http://arxiv.org/abs/1402.3450

17
17

Nov 30, 2017
11/17

by
Daniel Ellsberg

texts

######
eye 17

######
favorite 0

######
comment 0

Notes pertaining to The Doomsday Machine taken during the course of 2006.

Topics: The Doomsday Machine, nuclear war, Cuban Missile Crisis, non-proliferation, game theory, strategic...

8
8.0

Nov 13, 2019
11/19

by
Xie, Shiyu, 1962-

texts

######
eye 8

######
favorite 0

######
comment 0

2, 4, 7, 393 pages : 23 cm

Topics: Game theory, Economics, Mathematical, Jing ji xue -- dui ce lun -- ying yong -- gao deng xue xiao...

4
4.0

Jun 30, 2018
06/18

by
Thomas Brihaye; Gilles Geeraerts; Shankara Narayanan Krishna; Lakshmi Manasa; Benjamin Monmege; Ashutosh Trivedi

texts

######
eye 4

######
favorite 0

######
comment 0

Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions in order to optimize cost to reach target states. Bouyer et al. and Alur, Bernadsky, and Madhusudan independently proposed algorithms to solve PTGs with nonnegative prices under certain divergence restriction over prices. Brihaye, Bruyere, and Raskin later provided a justification for such a restriction by showing the...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1404.5894

4
4.0

Jun 30, 2018
06/18

by
Christos Tzamos; Christopher A. Wilkens

texts

######
eye 4

######
favorite 0

######
comment 0

Many auction settings implicitly or explicitly require that bidders are treated equally ex-ante. This may be because discrimination is philosophically or legally impermissible, or because it is practically difficult to implement or impossible to enforce. We study so-called {\em anonymous} auctions to understand the revenue tradeoffs and to develop simple anonymous auctions that are approximately optimal. We consider digital goods settings and show that the optimal anonymous, dominant strategy...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1411.1379

4
4.0

Jun 28, 2018
06/18

by
Pradeep Dubey; Siddhartha Sahi; Martin Shubik

texts

######
eye 4

######
favorite 0

######
comment 0

We consider mechanisms that provide traders the opportunity to exchange commodity $i$ for commodity $j$, for certain ordered pairs $ij$. Given any connected graph $G$ of opportunities, we show that there is a unique mechanism $M_{G}$ that satisfies some natural conditions of "fairness" and "convenience". Let $\mathfrak{M}(m)$ denote the class of mechanisms $M_{G}$ obtained by varying $G$ on the commodity set $\left\{1,\ldots,m\right\} $. We define the complexity of a...

Topics: Combinatorics, Computer Science and Game Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1512.02317

57
57

May 13, 2010
05/10

by
Wrightsman, Lawrence S; O'Connor, John, 1933- joint comp; Baker, Norma J., 1929- joint comp

texts

######
eye 57

######
favorite 3

######
comment 0

Bibliography: p. 285-341

Topics: Game theory, Cooperation, Competition, Speltheorie, Wiskundige methoden, Sociale wetenschappen,...

Source: removedNEL

13
13

Jun 26, 2018
06/18

by
Heinrich H. Nax; Matjaz Perc

texts

######
eye 13

######
favorite 0

######
comment 0

We consider an environment where players are involved in a public goods game and must decide repeatedly whether to make an individual contribution or not. However, players lack strategically relevant information about the game and about the other players in the population. The resulting behavior of players is completely uncoupled from such information, and the individual strategy adjustment dynamics are driven only by reinforcement feedbacks from each player's own past. We show that the...

Topics: Quantitative Biology, Physics and Society, Physics, Computing Research Repository, Populations and...

Source: http://arxiv.org/abs/1501.06558

64
64

May 2, 2013
05/13

by
William Ham (programmer)

audio

######
eye 64

######
favorite 0

######
comment 0

The rest of the two-plus hour tribute to the brilliant career of Scott Miller (Game Theory/Loud Family), originally broadcast April 17, 2013 on the WOW & FLUTTER program, KMUN-FM 91.9, Astoria, OR.

Topics: Scott Miller, Loud Family, Game Theory

12
12

Jun 26, 2018
06/18

by
Ioannis Caragiannis; Xenophon Chatzigeorgiou; Panagiotis Kanellopoulos; George A. Krimpas; Nikos Protopapas; Alexandros A. Voudouris

texts

######
eye 12

######
favorite 0

######
comment 0

Motivated by recent progress on pricing in the AI literature, we study marketplaces that contain multiple vendors offering identical or similar products and unit-demand buyers with different valuations on these vendors. The objective of each vendor is to set the price of its product to a fixed value so that its profit is maximized. The profit depends on the vendor's price itself and the total volume of buyers that find the particular price more attractive than the price of the vendor's...

Topics: Artificial Intelligence, Computer Science and Game Theory, Computing Research Repository,...

Source: http://arxiv.org/abs/1502.03945

11
11

Jun 26, 2018
06/18

by
John Fearnley; Tobenna Peter Igwe; Rahul Savani

texts

######
eye 11

######
favorite 0

######
comment 0

While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate Nash equilibria. Here we provide such a study that compares a number of approximation methods and exact methods. In particular, we explore the trade-off between the quality of approximate equilibrium and the required running time to find one. We found that the existing library GAMUT, which has been the de facto...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1502.04980

9
9.0

Jun 28, 2018
06/18

by
Pavel Hubáček; Moni Naor; Jonathan Ullman

texts

######
eye 9

######
favorite 0

######
comment 0

The central result of classical game theory states that every finite normal form game has a Nash equilibrium, provided that players are allowed to use randomized (mixed) strategies. However, in practice, humans are known to be bad at generating random-like sequences, and true random bits may be unavailable. Even if the players have access to enough random bits for a single instance of the game their randomness might be insufficient if the game is played many times. In this work, we ask whether...

Topics: Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1507.01191

8
8.0

Jun 28, 2018
06/18

by
Katarína Cechlárová; Pavlos Eirinakis; Tamás Fleiner; Dimitrios Magos; David Manlove; Ioannis Mourtos; Eva Oceláková; Baharak Rastegari

texts

######
eye 8

######
favorite 0

######
comment 0

We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the most general setting examined so far in the literature, our work unifies and generalizes several known results. Specifically, we characterize POMs and introduce the \emph{Generalized Serial Dictatorship Mechanism with Ties (GSDT)} that effectively...

Topics: Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1507.02866

5
5.0

Jun 30, 2018
06/18

by
Lin Gao; Biying Shou; Ying-Ju Chen; Jianwei Huang

texts

######
eye 5

######
favorite 0

######
comment 0

Dynamic spectrum access is a new paradigm of secondary spectrum utilization and sharing. It allows unlicensed secondary users (SUs) to exploit opportunistically the under-utilized licensed spectrum. Market mechanism is a widely-used promising means to regulate the consuming behaviours of users and, hence, achieves the efficient allocation and consumption of limited resources. In this paper, we propose and study a hybrid secondary spectrum market consisting of both the futures market and the...

Topics: Computer Science and Game Theory, Networking and Internet Architecture, Computing Research...

Source: http://arxiv.org/abs/1405.7175

3
3.0

Jun 30, 2018
06/18

by
Ioannis Caragiannis; Panagiotis Kanellopoulos; Alexandros A. Voudouris

texts

######
eye 3

######
favorite 0

######
comment 0

Social networks on the Internet have seen an enormous growth recently and play a crucial role in different aspects of today's life. They have facilitated information dissemination in ways that have been beneficial for their users but they are often used strategically in order to spread information that only serves the objectives of particular users. These properties have inspired a revision of classical opinion formation models from sociology using game-theoretic notions and tools. We follow...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1702.07309

4
4.0

Jun 30, 2018
06/18

by
Moshe Babaioff; Yishay Mansour; Noam Nisan; Gali Noti; Carlo Curino; Nar Ganapathy; Ishai Menache; Omer Reingold; Moshe Tennenholtz; Erez Timnat

texts

######
eye 4

######
favorite 0

######
comment 0

Cloud computing has reached significant maturity from a systems perspective, but currently deployed solutions rely on rather basic economics mechanisms that yield suboptimal allocation of the costly hardware resources. In this paper we present Economic Resource Allocation (ERA), a complete framework for scheduling and pricing cloud resources, aimed at increasing the efficiency of cloud resources usage by allocating resources according to economic principles. The ERA architecture carefully...

Topics: Computer Science and Game Theory, Computing Research Repository, Distributed, Parallel, and Cluster...

Source: http://arxiv.org/abs/1702.07311

4
4.0

Jun 30, 2018
06/18

by
Moran Feldman; Moshe Tennenholtz; Omri Weinstein

texts

######
eye 4

######
favorite 0

######
comment 0

A recurring theme in recent computer science literature is that proper design of signaling schemes is a crucial aspect of effective mechanisms aiming to optimize social welfare or revenue. One of the research endeavors of this line of work is understanding the algorithmic and computational complexity of designing efficient signaling schemes. In reality, however, information is typically not held by a central authority, but is distributed among multiple sources (third-party...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1404.2861

5
5.0

Jun 27, 2018
06/18

by
Nick Arnosti; Nicole Immorlica; Brendan Lucier

texts

######
eye 5

######
favorite 0

######
comment 0

We consider two-sided matching markets, and study the incentives of agents to circumvent a centralized clearing house by signing binding contracts with one another. It is well-known that if the clearing house implements a stable match and preferences are known, then no group of agents can profitably deviate in this manner. We ask whether this property holds even when agents have incomplete information about their own preferences or the preferences of others. We find that it does not. In...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1504.03257

13
13

Jun 29, 2018
06/18

by
Dengwang Tang; Vijay Subramanian

texts

######
eye 13

######
favorite 0

######
comment 0

With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most $k$ and also assuming that we can assess prices, we present a mechanism that is efficient, approximately envy-free, asymptotically strategy-proof and that has polynomial-time complexity. Modifying an iterative rounding procedure from assignment problems, we use the primal and dual optimal...

Topics: Computing Research Repository, Computer Science and Game Theory

Source: http://arxiv.org/abs/1606.01457

7
7.0

Feb 11, 2019
02/19

by
Weintraub, E. Roy

texts

######
eye 7

######
favorite 0

######
comment 0

95 p. : 22 cm

Topic: Game theory

4
4.0

Jun 30, 2018
06/18

by
Nicolas Gensollen; Vincent Gauthier; Michel Marot; Monique Becker

texts

######
eye 4

######
favorite 0

######
comment 0

In a smart grid environment, we study coalition formation of prosumers that aim at entering the energy market. It is paramount for the grid operation that the energy producers are able to sustain the grid demand in terms of stability and minimum production requirement. We design an algorithm that seeks to form coalitions that will meet both of these requirements: a minimum energy level for the coalitions and a steady production level which leads to finding uncorrelated sources of energy to form...

Topics: Computer Science and Game Theory, Computing Research Repository

Source: http://arxiv.org/abs/1410.8776