Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 55 for “"Algorithmic Game Theory"”.
-
Algorithmic Game Theory
… interaction of theoretical computer science with game theory and economics has resulted in the emergence of two very interesting research directions. First, it has provided a new model for algorithm design, which is to optimize in the presence of strategic behavior. Second, it has prompted us to …
-
A Learning Theoretic Approach To Algorithmic Game Theory
Algorithmic game theory attempts to mathematically capture behavior in strategic situations, in which an individual's success depends on the choices of others. Research in this area tends to focus on one of the following challenges: 1) Price of Anarchy: Characterize the inefficiency of equilibria …
-
Distributed management of competitive access to common resources using algorithmic game theory
… access to common resources through the use of algorithmic game theory. This approach is validated by the competitive, selfish and independent nature of the users. Additionally, in the case of QoS provision for the Internet, our solutions have to be distributed in order to be applicable. …
-
Mechanism Design for Heterogeneous and Distributed Facility Location Problems
As a field of study that integrates game theory and algorithm design, algorithmic game theory aims to design efficient algorithms in environments with strategic agents. In this thesis, we investigate one of algorithmic game theory's main classes of problems, namely facility location problems. In …
-
Hardness and totality of problems related to Nash equilibrium
… and their applications—a central topic in algorithmic game theory. While the existence of solutions for classical equilibrium notions, such as generalized Nash equilibria and multi-leader–follower games with convex constraints, is well established via foundational fixed-point theorems, the …
-
Complexity results for some classes of strategic games
Game theory is a branch of applied mathematics studying the interaction of self-interested entities, so-called agents. Its central objects of study are games, mathematical models of real-world interaction, and solution concepts that single out certain outcomes of a game that are meaningful in some …
-
Ανίχνευση εισβολών στην ασφάλεια της τεχνολογίας της πληροφορίας
… is to expand Intrusion Detection to the area of Game Theory, to borrow concepts required to study the interactions between users and Intrusion Detection Systems (IDSs). The results offer a better understanding of what directions should be followed by an IDS and what motivations drive a user …
-
A joint approach to ensuring the stationary location and persistent UAV network service
… and in telligent management of a UAV network. Algorithmic Game Theory (AGT) and Software Defined Network (SDN) techniques are used. Compared to previous work, the approach presented here is different in two aspects: (i) A distributed system with a joint solution to the problems of the …
-
Algorithmic Delegation: From Classic Auctions to Modern Digital Economy
… practical relevance in the broader literature of algorithmic game theory.
-
Mechanism design, social choice and equilibrium computation in restricted domains
… this thesis primarily revolves around efficient algorithmic frameworks for settings where information is not readily available. Specifically, we look at limitations of provided information from three main angles: (1) Information is difficult to quantify. In this line of work we focused on …
-
Decentralized leadership and follower deception in Stackelberg games
… thesis focuses on two aspects of Stackelberg games — decentralized leadership and follower deception — that stem from reasoning about strategic interactions at a higher level in Stackelberg games.</p> <p>In the first part of the thesis, we study decentralized leadership in Stackelberg games. …
-
Computing solution concepts in games with integer decisions
Computing solution concepts in games is an important endeavor in the field of algorithmic game theory. This thesis explores two contexts – simultaneous games and sequential games – for computing solution concepts in games where some or all of the decisions of players can be modeled as integer …
-
An Algorithmic Approach To Analyzing Social Phenomena
… of scientific communities by studying a simple game theoretic model illustrating the process by which researchers choose a research project. Our results are not restricted to the academic domain alone, as crowd sourcing sites like Wikipedia are already implementing number of credit-allocation …
-
Foundations and applications of program obfuscation
… of computing a Nash equilibrium vii of a game { a central problem in algorithmic game theory and complexity theory. Based on indistinguishability obfuscation, we construct explicit games where a Nash equilibrium cannot be found efficiently. We also prove the following results on the …
-
Information Economics in the Age of e-Commerce: Models and Mechanisms for Information-Rich Markets
… and selfishly. This led to the birth of algorithmic game theory, whose goal is to understand equilibria arising in these strategic environments, study their computational complexity, and design mechanisms accordingly. More recently, the prevalence and access to information about consumers …
-
Making Decisions with Incomplete and Inaccurate Information
From assigning students to public schools to arriving at divorce settlements, there are many settings where preferences expressed by a set of stakeholders are used to make decisions that affect them. Due to its numerous applications, and thanks to the range of questions involved, such settings have …
-
An Algorithm for Stable Matching with Approximation up to the Integrality Gap
In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to find an assignment of agents in one group to those in the other such that no …
-
The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information
The field of algorithmic mechanism design is concerned with the design of computationally efficient algorithms for use when inputs are provided by rational agents, who may misreport their private values in order to strategically manipulate the algorithm for their own benefit. We revisit classic …
-
Market intermediation: information, computation, and incentives
<p>Auctions are a major field of interest in game theory and in the wider mi- croeconomics area, reflected by recognitions such as Nobel prizes to William Vickrey and Paul Milgrom. The algorithmic game theory literature too pro- vides discussion of a wide range of different auction settings. But …
-
Incentive-aware Machine Learning for social welfare maximization under uncertainty
… trials. Under the influence of these substantial algorithmic decisions, individuals (i.e., the decision-subjects) are more aware of their role and capabilities in dictating the outcome of Machine Learning algorithms. On the other hand, the social planner (i.e., the decision-maker) deploying these …
Page 1 of 3