Results 71 to 80 of about 5,328 (177)
Interdomain routing and games [PDF]
We present a game-theoretic model that captures many of the intricacies of \emph{interdomain routing} in today's Internet. In this model, the strategic agents are source nodes located on a network, who aim to send traffic to a unique destination node ...
Levin, Hagay +2 more
core +1 more source
Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach
This paper studies repeated games where two players play multiple duopolistic games simultaneously (multimarket contact). A key assumption is that each player receives a noisy and private signal about the other's actions (private monitoring or ...
Iwasaki, Atsushi +3 more
core +1 more source
The Strategic Justification for BGP [PDF]
The Internet consists of many administrative domains, or \emph{Autonomous Systems} (ASes), each owned by an economic entity (Microsoft, AT\&T, The Hebrew University, etc.).
Levin, Hagay +2 more
core +1 more source
Bribeproof mechanisms for two-values domains
Schummer (Journal of Economic Theory 2000) introduced the concept of bribeproof mechanism which, in a context where monetary transfer between agents is possible, requires that manipulations through bribes are ruled out.
C Mukherjee +18 more
core +1 more source
Average-case Approximation Ratio of Scheduling without Payments
Apart from the principles and methodologies inherited from Economics and Game Theory, the studies in Algorithmic Mechanism Design typically employ the worst-case analysis and approximation schemes of Theoretical Computer Science.
Zhang, Jie
core +1 more source
The next generation of digital currencies: in search of stability. Bruegel Policy Contribution Issue #15 December 2019 [PDF]
Four major developments have challenged the status quo and reopened the debate on the forms that money will take in the future: 1) use of cash as a medium of exchange has declined; 2) distributed ledger technology (DLT) has led to the emergence of ...
Claeys, Grégory, Demertzis, Maria
core
Algorithmic collusion: theory & practice
We develop a framework to analyze the evolution of bounded memory strategies in a repeated game. In this framework, we introduce the algorithmic learning equations, a set of ordinary differential equations which characterizes the finite-time and asymptotic behavior of the stochastic interaction between learning algorithms that learn a bounded memory ...
openaire +2 more sources
Algorithmic Collusion Without Threats
There has been substantial recent concern that pricing algorithms might learn to ``collude.'' Supra-competitive prices can emerge as a Nash equilibrium of repeated pricing games, in which sellers play strategies which threaten to punish their competitors who refuse to support high prices, and these strategies can be automatically learned.
Arunachaleswaran, Eshwar Ram +4 more
openaire +4 more sources
A personal networking solution [PDF]
This paper presents an overview of research being conducted on Personal Networking Solutions within the Mobile VCE Personal Distributed Environment Work Area. In particular it attempts to highlight areas of commonality with the MAGNET initiative.
Atkinson, R.C., Dunlop, J., Irvine, J.
core
A Survey of Digital Watermarking Techniques and its Applications [PDF]
Digital media is the need of a people now a day as the alternate of paper media.As the technology grown up digital media required protection while transferring through internet or others mediums.Watermarking techniques have been developed to fulfill this
Saini, Lalit Kumar, Shrivastava, Vishal
core

