ACM Home Page ACM Digital Library Home Page
Author image not provided
 Evangelos Markakis

No contact information provided yet.


Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Publication years2001-2010
Publication count28
Citation Count183
Available for download9
Downloads (6 Weeks)49
Downloads (12 Months)443
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas



AUTHOR PROFILE PAGES (BETA)
Project background

BOOKMARK & SHARE


28 search results
 Sort by: 
Page: 1   2   3    next    >>
Export results as: BibTeX   EndNotes   ACM Ref
2010
1
Discrete strategies in keyword auctions and their inefficiency for locally aware bidders
December 2010
WINE'10: Proceedings of the 6th international conference on Internet and network economics
Publisher: Springer-Verlag
Full text available: Publisher SitePublisher Site
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
We study formally discrete bidding strategies for the game induced by the Generalized Second Price keyword auction mechanism. Such strategies have seen experimental evaluation in the recent literature as parts of iterative best response procedures, which ...
 
2
Coalition formation and price of anarchy in cournot oligopolies
December 2010
WINE'10: Proceedings of the 6th international conference on Internet and network economics
Publisher: Springer-Verlag
Full text available: Publisher SitePublisher Site
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Non-cooperative game theory purports that economic agents behave with little regard towards the negative externalities they impose on each other. Such behaviors generally lead to inefficient outcomes where the social welfare is bounded away from its ...
 
3
Cooperative games with overlapping coalitions
September 2010
Journal of Artificial Intelligence Research , Volume 39 Issue 1
Publisher: AI Access Foundation
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coalitions. However, in many domains where coalitions are associated with tasks, ...
 
4
Approximating power indices: theoretical and empirical analysis
March 2010
Autonomous Agents and Multi-Agent Systems , Volume 20 Issue 2
Publisher: Kluwer Academic Publishers
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 3

Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are unequal in their power to affect the outcome of the game. Prior research on ...



Keywords: Banzhaf power index, Coalitional games, Power index, Power index approximation, Power indices, Shapley value, Shapley---Shubik power index
 
5
New algorithms for approximate Nash equilibria in bimatrix games
January 2010
Theoretical Computer Science , Volume 411 Issue 1
Publisher: Elsevier Science Publishers Ltd.
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1

We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that ...



Keywords: Approximate Nash equilibria, Noncooperative games
 
2009
6
Sequential Bidding in the Bailey-Cavallo Mechanism
December 2009
WINE '09: Proceedings of the 5th International Workshop on Internet and Network Economics
Publisher: Springer-Verlag
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0

We are interested in mechanisms that maximize social welfare. In [2] this problem was studied for multi-unit auctions and for public project problems, and in each case social welfare undominated mechanisms were identified. One way to improve upon these ...

 
7
Externalities in Keyword Auctions: An Empirical and Theoretical Assessment
December 2009
WINE '09: Proceedings of the 5th International Workshop on Internet and Network Economics
Publisher: Springer-Verlag
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 2

The value of acquiring a slot in a sponsored search list (that comes along with the organic links in a search engine's result page) might depend on who else is shown in the other sponsored positions. To empirically evaluate this claim, we develop a model ...

 
8
Stability of overlapping coalitions
July 2009
SIGecom Exchanges , Volume 8 Issue 1
Publisher: ACM
Full text available: PdfPdf (133.77 KB)
 Bibliometrics:  Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 0


Keywords: coalition formation, economics, theory
 
9
Optimal strategies in sequential bidding
May 2009
AAMAS '09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 , Volume 2
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Full text available: PdfPdf (168.05 KB)
 Bibliometrics:  Downloads (6 Weeks): 0,   Downloads (12 Months): 19,   Citation Count: 1

We are interested in mechanisms that maximize the final social welfare. In [1] this problem was studied for multi-unit auctions with unit demand bidders and for the public project problem, and in each case social welfare undominated mechanisms in the ...

 
10
On the Fourier spectrum of symmetric Boolean functions
May 2009
Combinatorica , Volume 29 Issue 3
Publisher: Springer-Verlag New York, Inc.
 Bibliometrics:  Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0

We study the following question What is the smallest t such that every symmetric boolean function on κ variables (which is not a constant or a parity function), has a non-zero Fourier coefficient of order at least 1 and at most t? ...



Keywords: 68Q32
 
  Page: 1   2   3    next    >>

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2011 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us